/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:05:51,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:05:51,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:05:51,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:05:51,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:05:51,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:05:51,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:05:51,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:05:51,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:05:51,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:05:51,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:05:51,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:05:51,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:05:51,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:05:51,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:05:51,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:05:51,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:05:51,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:05:51,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:05:51,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:05:51,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:05:51,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:05:51,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:05:51,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:05:51,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:05:51,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:05:51,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:05:51,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:05:51,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:05:51,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:05:51,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:05:51,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:05:51,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:05:51,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:05:51,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:05:51,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:05:51,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:05:51,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:05:51,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:05:51,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:05:51,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:05:51,632 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:05:51,645 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:05:51,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:05:51,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:05:51,647 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:05:51,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:05:51,647 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:05:51,647 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:05:51,648 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:05:51,648 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:05:51,648 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:05:51,648 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:05:51,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:05:51,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:05:51,649 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:05:51,649 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:05:51,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:05:51,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:05:51,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:05:51,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:05:51,650 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:05:51,650 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:05:51,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:05:51,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:05:51,650 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:05:51,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:05:51,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:05:51,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:05:51,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:05:51,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:05:51,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:05:51,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:05:51,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:05:51,838 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:05:51,838 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:05:51,839 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:05:59,156 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_ePJXPc/tmp/c870d8ef2f8b4a46af8976554dde41a6/FLAG0bdd2b8fc !SESSION 2020-07-01 11:05:49.360 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_ePJXPc/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 11:05:59.266 !MESSAGE Indexed 'FLAG0bdd2b8fc' (0 sources, 0 headers) in 0.007 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 11:05:59,511 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:05:59,512 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:05:59,512 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 11:05:59,520 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_ePJXPc/tmp/c870d8ef2f8b4a46af8976554dde41a6/FLAG0bdd2b8fc [2020-07-01 11:05:59,549 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_ePJXPc/tmp/c870d8ef2f8b4a46af8976554dde41a6 [2020-07-01 11:05:59,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:05:59,562 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:05:59,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:05:59,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:05:59,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:05:59,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d89aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59, skipping insertion in model container [2020-07-01 11:05:59,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:05:59,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:05:59,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:05:59,836 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:05:59,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:05:59,871 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:05:59,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59 WrapperNode [2020-07-01 11:05:59,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:05:59,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:05:59,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:05:59,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:05:59,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:05:59,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:05:59,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:05:59,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:05:59,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... [2020-07-01 11:05:59,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:05:59,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:05:59,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:05:59,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:05:59,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:06:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:06:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 11:06:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:06:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:06:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:06:00,315 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:06:00,316 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-01 11:06:00,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:00 BoogieIcfgContainer [2020-07-01 11:06:00,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:06:00,323 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:06:00,323 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:06:00,325 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:06:00,326 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:00" (1/1) ... [2020-07-01 11:06:00,343 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 54 edges [2020-07-01 11:06:00,344 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:06:00,345 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:06:00,345 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:06:00,346 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:06:00,347 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:06:00,348 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:06:00,348 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:06:00,379 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:06:00,418 INFO L200 BlockEncoder]: SBE split 24 edges [2020-07-01 11:06:00,424 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 11:06:00,425 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:06:00,463 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 11:06:00,466 INFO L70 RemoveSinkStates]: Removed 17 edges and 2 locations by removing sink states [2020-07-01 11:06:00,467 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:06:00,468 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:06:00,468 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:06:00,469 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:06:00,470 INFO L313 BlockEncoder]: Encoded RCFG 37 locations, 73 edges [2020-07-01 11:06:00,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:00 BasicIcfg [2020-07-01 11:06:00,471 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:06:00,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:06:00,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:06:00,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:06:00,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:05:59" (1/4) ... [2020-07-01 11:06:00,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:06:00, skipping insertion in model container [2020-07-01 11:06:00,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (2/4) ... [2020-07-01 11:06:00,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:06:00, skipping insertion in model container [2020-07-01 11:06:00,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:00" (3/4) ... [2020-07-01 11:06:00,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0d802e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:00, skipping insertion in model container [2020-07-01 11:06:00,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:00" (4/4) ... [2020-07-01 11:06:00,479 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:06:00,489 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:06:00,497 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 11:06:00,511 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 11:06:00,535 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:06:00,535 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:06:00,535 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:06:00,536 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:06:00,536 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:06:00,536 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:06:00,536 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:06:00,536 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:06:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-01 11:06:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:06:00,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:00,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:06:00,559 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 8278757, now seen corresponding path program 1 times [2020-07-01 11:06:00,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:00,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85364854] [2020-07-01 11:06:00,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:00,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85364854] [2020-07-01 11:06:00,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:00,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:06:00,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265698726] [2020-07-01 11:06:00,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:00,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:00,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:00,767 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-01 11:06:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:00,936 INFO L93 Difference]: Finished difference Result 65 states and 127 transitions. [2020-07-01 11:06:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:00,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:06:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:00,952 INFO L225 Difference]: With dead ends: 65 [2020-07-01 11:06:00,952 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 11:06:00,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 11:06:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 11:06:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:06:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2020-07-01 11:06:00,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 69 transitions. Word has length 4 [2020-07-01 11:06:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:00,998 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 69 transitions. [2020-07-01 11:06:00,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 69 transitions. [2020-07-01 11:06:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:06:00,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:00,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:06:00,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:06:00,999 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 8278758, now seen corresponding path program 1 times [2020-07-01 11:06:01,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:01,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140578631] [2020-07-01 11:06:01,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:01,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140578631] [2020-07-01 11:06:01,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:01,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:01,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193710031] [2020-07-01 11:06:01,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:06:01,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:06:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:06:01,038 INFO L87 Difference]: Start difference. First operand 37 states and 69 transitions. Second operand 4 states. [2020-07-01 11:06:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:01,149 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2020-07-01 11:06:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:06:01,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:06:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:01,151 INFO L225 Difference]: With dead ends: 37 [2020-07-01 11:06:01,151 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 11:06:01,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:06:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 11:06:01,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 11:06:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 11:06:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2020-07-01 11:06:01,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 4 [2020-07-01 11:06:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:01,159 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. [2020-07-01 11:06:01,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:06:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. [2020-07-01 11:06:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:06:01,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:01,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:06:01,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:06:01,160 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:01,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash 8278755, now seen corresponding path program 1 times [2020-07-01 11:06:01,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:01,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562342362] [2020-07-01 11:06:01,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:01,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562342362] [2020-07-01 11:06:01,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:01,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:06:01,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069238194] [2020-07-01 11:06:01,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:01,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:01,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:01,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:01,184 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. [2020-07-01 11:06:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:01,280 INFO L93 Difference]: Finished difference Result 35 states and 67 transitions. [2020-07-01 11:06:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:01,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:06:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:01,282 INFO L225 Difference]: With dead ends: 35 [2020-07-01 11:06:01,282 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 11:06:01,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 11:06:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 11:06:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 11:06:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-01 11:06:01,288 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 63 transitions. Word has length 4 [2020-07-01 11:06:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:01,289 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 63 transitions. [2020-07-01 11:06:01,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2020-07-01 11:06:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:06:01,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:01,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:01,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:06:01,290 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 631126807, now seen corresponding path program 1 times [2020-07-01 11:06:01,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:01,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380061695] [2020-07-01 11:06:01,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:01,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380061695] [2020-07-01 11:06:01,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:01,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:06:01,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469073691] [2020-07-01 11:06:01,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:06:01,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:06:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:06:01,394 INFO L87 Difference]: Start difference. First operand 33 states and 63 transitions. Second operand 6 states. [2020-07-01 11:06:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:01,886 INFO L93 Difference]: Finished difference Result 111 states and 227 transitions. [2020-07-01 11:06:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:06:01,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 11:06:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:01,888 INFO L225 Difference]: With dead ends: 111 [2020-07-01 11:06:01,888 INFO L226 Difference]: Without dead ends: 109 [2020-07-01 11:06:01,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:06:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-01 11:06:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 31. [2020-07-01 11:06:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 11:06:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2020-07-01 11:06:01,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 8 [2020-07-01 11:06:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:01,898 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 59 transitions. [2020-07-01 11:06:01,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:06:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-07-01 11:06:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:06:01,898 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:01,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:01,899 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:06:01,899 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash 631126809, now seen corresponding path program 1 times [2020-07-01 11:06:01,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:01,900 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108429453] [2020-07-01 11:06:01,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:01,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108429453] [2020-07-01 11:06:01,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:01,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:06:01,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648588270] [2020-07-01 11:06:01,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:06:01,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:06:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:06:01,955 INFO L87 Difference]: Start difference. First operand 31 states and 59 transitions. Second operand 5 states. [2020-07-01 11:06:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:02,117 INFO L93 Difference]: Finished difference Result 57 states and 107 transitions. [2020-07-01 11:06:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:06:02,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 11:06:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:02,118 INFO L225 Difference]: With dead ends: 57 [2020-07-01 11:06:02,119 INFO L226 Difference]: Without dead ends: 55 [2020-07-01 11:06:02,119 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-01 11:06:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2020-07-01 11:06:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:06:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2020-07-01 11:06:02,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 8 [2020-07-01 11:06:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:02,127 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 66 transitions. [2020-07-01 11:06:02,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:06:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. [2020-07-01 11:06:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:06:02,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:02,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:02,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:06:02,128 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash 631126810, now seen corresponding path program 1 times [2020-07-01 11:06:02,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:02,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362458293] [2020-07-01 11:06:02,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:02,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362458293] [2020-07-01 11:06:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:06:02,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990121622] [2020-07-01 11:06:02,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:06:02,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:06:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:02,221 INFO L87 Difference]: Start difference. First operand 34 states and 66 transitions. Second operand 7 states. [2020-07-01 11:06:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:02,832 INFO L93 Difference]: Finished difference Result 161 states and 317 transitions. [2020-07-01 11:06:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 11:06:02,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 11:06:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:02,856 INFO L225 Difference]: With dead ends: 161 [2020-07-01 11:06:02,856 INFO L226 Difference]: Without dead ends: 159 [2020-07-01 11:06:02,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-07-01 11:06:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-07-01 11:06:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 41. [2020-07-01 11:06:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 11:06:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 77 transitions. [2020-07-01 11:06:02,867 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 77 transitions. Word has length 8 [2020-07-01 11:06:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:02,867 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 77 transitions. [2020-07-01 11:06:02,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:06:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 77 transitions. [2020-07-01 11:06:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 11:06:02,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:02,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:02,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 11:06:02,869 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 659755961, now seen corresponding path program 1 times [2020-07-01 11:06:02,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:02,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864239684] [2020-07-01 11:06:02,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:02,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864239684] [2020-07-01 11:06:02,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:02,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:06:02,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475007972] [2020-07-01 11:06:02,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:06:02,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:06:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:02,954 INFO L87 Difference]: Start difference. First operand 41 states and 77 transitions. Second operand 7 states. [2020-07-01 11:06:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:03,167 INFO L93 Difference]: Finished difference Result 62 states and 116 transitions. [2020-07-01 11:06:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:06:03,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-07-01 11:06:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:03,168 INFO L225 Difference]: With dead ends: 62 [2020-07-01 11:06:03,168 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 11:06:03,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:06:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 11:06:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2020-07-01 11:06:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:06:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2020-07-01 11:06:03,175 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 8 [2020-07-01 11:06:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:03,175 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 64 transitions. [2020-07-01 11:06:03,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:06:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 64 transitions. [2020-07-01 11:06:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 11:06:03,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:03,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:03,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:06:03,176 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash 922435564, now seen corresponding path program 1 times [2020-07-01 11:06:03,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:03,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999275188] [2020-07-01 11:06:03,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:03,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999275188] [2020-07-01 11:06:03,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:03,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:06:03,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468936261] [2020-07-01 11:06:03,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:03,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:03,212 INFO L87 Difference]: Start difference. First operand 34 states and 64 transitions. Second operand 3 states. [2020-07-01 11:06:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:03,272 INFO L93 Difference]: Finished difference Result 36 states and 64 transitions. [2020-07-01 11:06:03,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:03,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 11:06:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:03,273 INFO L225 Difference]: With dead ends: 36 [2020-07-01 11:06:03,273 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 11:06:03,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 11:06:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 11:06:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:06:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 62 transitions. [2020-07-01 11:06:03,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 62 transitions. Word has length 10 [2020-07-01 11:06:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:03,279 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 62 transitions. [2020-07-01 11:06:03,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 62 transitions. [2020-07-01 11:06:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 11:06:03,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:03,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:03,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 11:06:03,280 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash 922435565, now seen corresponding path program 1 times [2020-07-01 11:06:03,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:03,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777221256] [2020-07-01 11:06:03,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:03,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777221256] [2020-07-01 11:06:03,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:03,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:06:03,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085115973] [2020-07-01 11:06:03,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:03,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:03,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:03,314 INFO L87 Difference]: Start difference. First operand 34 states and 62 transitions. Second operand 3 states. [2020-07-01 11:06:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:03,371 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-07-01 11:06:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:03,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-01 11:06:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:03,372 INFO L225 Difference]: With dead ends: 34 [2020-07-01 11:06:03,372 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 11:06:03,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 11:06:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 11:06:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 11:06:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-07-01 11:06:03,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 10 [2020-07-01 11:06:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:03,378 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-07-01 11:06:03,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-07-01 11:06:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:06:03,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:03,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:03,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 11:06:03,379 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1469207035, now seen corresponding path program 1 times [2020-07-01 11:06:03,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:03,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213822773] [2020-07-01 11:06:03,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:03,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213822773] [2020-07-01 11:06:03,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:03,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:06:03,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248699039] [2020-07-01 11:06:03,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:06:03,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:06:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:06:03,422 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 5 states. [2020-07-01 11:06:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:03,507 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. [2020-07-01 11:06:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:06:03,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 11:06:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:03,508 INFO L225 Difference]: With dead ends: 30 [2020-07-01 11:06:03,509 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 11:06:03,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 11:06:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 11:06:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 11:06:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 51 transitions. [2020-07-01 11:06:03,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 51 transitions. Word has length 11 [2020-07-01 11:06:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:03,514 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 51 transitions. [2020-07-01 11:06:03,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:06:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 51 transitions. [2020-07-01 11:06:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:06:03,514 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:03,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:03,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 11:06:03,515 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1469207033, now seen corresponding path program 1 times [2020-07-01 11:06:03,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:03,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459956306] [2020-07-01 11:06:03,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:03,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459956306] [2020-07-01 11:06:03,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:03,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:06:03,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729806380] [2020-07-01 11:06:03,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:06:03,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:06:03,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:06:03,557 INFO L87 Difference]: Start difference. First operand 27 states and 51 transitions. Second operand 5 states. [2020-07-01 11:06:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:03,666 INFO L93 Difference]: Finished difference Result 45 states and 84 transitions. [2020-07-01 11:06:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:06:03,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 11:06:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:03,667 INFO L225 Difference]: With dead ends: 45 [2020-07-01 11:06:03,667 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 11:06:03,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 11:06:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2020-07-01 11:06:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:06:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 73 transitions. [2020-07-01 11:06:03,673 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 73 transitions. Word has length 11 [2020-07-01 11:06:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:03,674 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 73 transitions. [2020-07-01 11:06:03,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:06:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 73 transitions. [2020-07-01 11:06:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:06:03,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:03,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:03,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 11:06:03,675 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1469207032, now seen corresponding path program 1 times [2020-07-01 11:06:03,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:03,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938838908] [2020-07-01 11:06:03,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:03,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938838908] [2020-07-01 11:06:03,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:03,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:06:03,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942420993] [2020-07-01 11:06:03,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:06:03,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:06:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:06:03,736 INFO L87 Difference]: Start difference. First operand 34 states and 73 transitions. Second operand 6 states. [2020-07-01 11:06:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:04,043 INFO L93 Difference]: Finished difference Result 73 states and 149 transitions. [2020-07-01 11:06:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:06:04,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-01 11:06:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:04,045 INFO L225 Difference]: With dead ends: 73 [2020-07-01 11:06:04,045 INFO L226 Difference]: Without dead ends: 70 [2020-07-01 11:06:04,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:06:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-01 11:06:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2020-07-01 11:06:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-01 11:06:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2020-07-01 11:06:04,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 135 transitions. Word has length 11 [2020-07-01 11:06:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:04,055 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 135 transitions. [2020-07-01 11:06:04,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:06:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 135 transitions. [2020-07-01 11:06:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:06:04,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:04,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:04,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 11:06:04,056 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash -154050024, now seen corresponding path program 1 times [2020-07-01 11:06:04,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:04,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400973787] [2020-07-01 11:06:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:04,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400973787] [2020-07-01 11:06:04,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:04,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 11:06:04,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764631697] [2020-07-01 11:06:04,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:06:04,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:06:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:06:04,123 INFO L87 Difference]: Start difference. First operand 58 states and 135 transitions. Second operand 6 states. [2020-07-01 11:06:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:04,307 INFO L93 Difference]: Finished difference Result 70 states and 151 transitions. [2020-07-01 11:06:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:06:04,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-01 11:06:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:04,309 INFO L225 Difference]: With dead ends: 70 [2020-07-01 11:06:04,309 INFO L226 Difference]: Without dead ends: 67 [2020-07-01 11:06:04,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:06:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-01 11:06:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 34. [2020-07-01 11:06:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 11:06:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2020-07-01 11:06:04,316 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 11 [2020-07-01 11:06:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:04,316 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2020-07-01 11:06:04,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:06:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2020-07-01 11:06:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:06:04,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:04,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:04,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 11:06:04,318 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash 964598445, now seen corresponding path program 1 times [2020-07-01 11:06:04,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:04,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980633940] [2020-07-01 11:06:04,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:04,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980633940] [2020-07-01 11:06:04,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:04,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:04,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160188036] [2020-07-01 11:06:04,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:04,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:04,346 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 3 states. [2020-07-01 11:06:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:04,442 INFO L93 Difference]: Finished difference Result 62 states and 133 transitions. [2020-07-01 11:06:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:04,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 11:06:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:04,443 INFO L225 Difference]: With dead ends: 62 [2020-07-01 11:06:04,444 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 11:06:04,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 11:06:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-01 11:06:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:06:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2020-07-01 11:06:04,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 15 [2020-07-01 11:06:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:04,450 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. [2020-07-01 11:06:04,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. [2020-07-01 11:06:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 11:06:04,451 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:04,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:04,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 11:06:04,451 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 964628236, now seen corresponding path program 1 times [2020-07-01 11:06:04,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:04,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381369281] [2020-07-01 11:06:04,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:04,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381369281] [2020-07-01 11:06:04,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:04,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:04,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539230235] [2020-07-01 11:06:04,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:06:04,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:04,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:04,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:04,479 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand 3 states. [2020-07-01 11:06:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:04,550 INFO L93 Difference]: Finished difference Result 64 states and 131 transitions. [2020-07-01 11:06:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:04,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 11:06:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:04,551 INFO L225 Difference]: With dead ends: 64 [2020-07-01 11:06:04,552 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 11:06:04,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 11:06:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 11:06:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:06:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2020-07-01 11:06:04,557 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 69 transitions. Word has length 15 [2020-07-01 11:06:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:04,558 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 69 transitions. [2020-07-01 11:06:04,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:06:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 69 transitions. [2020-07-01 11:06:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 11:06:04,559 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:04,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:04,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 11:06:04,559 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash -735491685, now seen corresponding path program 1 times [2020-07-01 11:06:04,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:04,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158875398] [2020-07-01 11:06:04,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:04,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158875398] [2020-07-01 11:06:04,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447142713] [2020-07-01 11:06:04,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:04,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:06:04,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:04,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:06:04,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 11:06:04,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270407052] [2020-07-01 11:06:04,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:06:04,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:04,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:06:04,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:04,711 INFO L87 Difference]: Start difference. First operand 37 states and 69 transitions. Second operand 4 states. [2020-07-01 11:06:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:04,828 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2020-07-01 11:06:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:06:04,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-01 11:06:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:04,829 INFO L225 Difference]: With dead ends: 46 [2020-07-01 11:06:04,830 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 11:06:04,830 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 11:06:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-01 11:06:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 11:06:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-07-01 11:06:04,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 17 [2020-07-01 11:06:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:04,836 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-07-01 11:06:04,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:06:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2020-07-01 11:06:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 11:06:04,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:04,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:05,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-01 11:06:05,038 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -735491684, now seen corresponding path program 1 times [2020-07-01 11:06:05,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:05,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582780058] [2020-07-01 11:06:05,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:05,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582780058] [2020-07-01 11:06:05,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:05,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 11:06:05,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947114129] [2020-07-01 11:06:05,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 11:06:05,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 11:06:05,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:05,118 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand 7 states. [2020-07-01 11:06:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:05,337 INFO L93 Difference]: Finished difference Result 85 states and 147 transitions. [2020-07-01 11:06:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 11:06:05,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-01 11:06:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:05,338 INFO L225 Difference]: With dead ends: 85 [2020-07-01 11:06:05,339 INFO L226 Difference]: Without dead ends: 58 [2020-07-01 11:06:05,339 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:06:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-01 11:06:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-01 11:06:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-01 11:06:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2020-07-01 11:06:05,346 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2020-07-01 11:06:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:05,347 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2020-07-01 11:06:05,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 11:06:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2020-07-01 11:06:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 11:06:05,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:05,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:05,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 11:06:05,348 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1134972500, now seen corresponding path program 1 times [2020-07-01 11:06:05,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:05,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326231399] [2020-07-01 11:06:05,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:05,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326231399] [2020-07-01 11:06:05,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832055462] [2020-07-01 11:06:05,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:05,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:06:05,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:05,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:05,621 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:05,635 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:05,635 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:05,635 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:06:05,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:06:05,671 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:05,681 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:05,682 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:05,682 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-07-01 11:06:05,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:05,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 11:06:05,785 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:05,788 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:05,806 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:05,808 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:06:05,810 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:05,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:34 [2020-07-01 11:06:05,866 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:05,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 11:06:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902633000] [2020-07-01 11:06:05,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:06:05,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:06:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:06:05,921 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 15 states. [2020-07-01 11:06:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:08,765 INFO L93 Difference]: Finished difference Result 82 states and 140 transitions. [2020-07-01 11:06:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 11:06:08,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-07-01 11:06:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:08,767 INFO L225 Difference]: With dead ends: 82 [2020-07-01 11:06:08,767 INFO L226 Difference]: Without dead ends: 79 [2020-07-01 11:06:08,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2020-07-01 11:06:08,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-01 11:06:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2020-07-01 11:06:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 11:06:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2020-07-01 11:06:08,776 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 17 [2020-07-01 11:06:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:08,777 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2020-07-01 11:06:08,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:06:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2020-07-01 11:06:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 11:06:08,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:08,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:08,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-01 11:06:08,979 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash -390090185, now seen corresponding path program 1 times [2020-07-01 11:06:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:08,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979311998] [2020-07-01 11:06:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:09,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979311998] [2020-07-01 11:06:09,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330946432] [2020-07-01 11:06:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:09,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:06:09,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:09,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:06:09,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 11:06:09,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741208231] [2020-07-01 11:06:09,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:06:09,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:06:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:09,086 INFO L87 Difference]: Start difference. First operand 49 states and 86 transitions. Second operand 4 states. [2020-07-01 11:06:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:09,184 INFO L93 Difference]: Finished difference Result 77 states and 134 transitions. [2020-07-01 11:06:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:06:09,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-01 11:06:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:09,186 INFO L225 Difference]: With dead ends: 77 [2020-07-01 11:06:09,186 INFO L226 Difference]: Without dead ends: 75 [2020-07-01 11:06:09,186 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 11:06:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-01 11:06:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2020-07-01 11:06:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-01 11:06:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2020-07-01 11:06:09,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 18 [2020-07-01 11:06:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:09,195 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2020-07-01 11:06:09,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:06:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2020-07-01 11:06:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 11:06:09,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:09,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:09,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:09,397 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash -390090184, now seen corresponding path program 1 times [2020-07-01 11:06:09,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:09,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419782917] [2020-07-01 11:06:09,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:09,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419782917] [2020-07-01 11:06:09,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121526121] [2020-07-01 11:06:09,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:09,666 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 11:06:09,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:09,698 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:09,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:06:09,712 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:09,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:06:09,720 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:09,748 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:09,751 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:06:09,751 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2020-07-01 11:06:09,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:09,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 11:06:09,818 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:09,835 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:09,837 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:09,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:32 [2020-07-01 11:06:09,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:09,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 11:06:09,903 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:09,924 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:09,927 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:09,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:39 [2020-07-01 11:06:09,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:09,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:09,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2020-07-01 11:06:09,992 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:09,993 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:10,014 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:10,016 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:06:10,017 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:10,018 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:31 [2020-07-01 11:06:10,064 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:10,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:10,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-01 11:06:10,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054252110] [2020-07-01 11:06:10,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:06:10,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:10,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:06:10,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:06:10,124 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand 17 states. [2020-07-01 11:06:10,751 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-07-01 11:06:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:11,976 INFO L93 Difference]: Finished difference Result 263 states and 459 transitions. [2020-07-01 11:06:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-01 11:06:11,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-07-01 11:06:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:11,978 INFO L225 Difference]: With dead ends: 263 [2020-07-01 11:06:11,979 INFO L226 Difference]: Without dead ends: 261 [2020-07-01 11:06:11,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2020-07-01 11:06:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-07-01 11:06:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 81. [2020-07-01 11:06:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-01 11:06:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 139 transitions. [2020-07-01 11:06:11,995 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 139 transitions. Word has length 18 [2020-07-01 11:06:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:11,995 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 139 transitions. [2020-07-01 11:06:11,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:06:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 139 transitions. [2020-07-01 11:06:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 11:06:11,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:11,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:12,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:12,197 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash -900624361, now seen corresponding path program 1 times [2020-07-01 11:06:12,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:12,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235751074] [2020-07-01 11:06:12,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:12,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235751074] [2020-07-01 11:06:12,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486834113] [2020-07-01 11:06:12,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:12,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 54 conjunts are in the unsatisfiable core [2020-07-01 11:06:12,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:12,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:12,434 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:12,438 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,448 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,449 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:06:12,449 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2020-07-01 11:06:12,473 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:12,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 11:06:12,484 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:06:12,489 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,508 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,511 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 11:06:12,511 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2020-07-01 11:06:12,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:06:12,587 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,597 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-07-01 11:06:12,602 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,612 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,613 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:12,613 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2020-07-01 11:06:12,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 11:06:12,653 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,663 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,664 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:12,664 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2020-07-01 11:06:12,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2020-07-01 11:06:12,705 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:12,706 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:12,717 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:12,717 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:06:12,718 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:12,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:37 [2020-07-01 11:06:12,760 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:12,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:12,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-07-01 11:06:12,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979434279] [2020-07-01 11:06:12,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 11:06:12,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 11:06:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-07-01 11:06:12,826 INFO L87 Difference]: Start difference. First operand 81 states and 139 transitions. Second operand 18 states. [2020-07-01 11:06:13,623 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2020-07-01 11:06:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:14,571 INFO L93 Difference]: Finished difference Result 126 states and 210 transitions. [2020-07-01 11:06:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 11:06:14,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-07-01 11:06:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:14,573 INFO L225 Difference]: With dead ends: 126 [2020-07-01 11:06:14,573 INFO L226 Difference]: Without dead ends: 125 [2020-07-01 11:06:14,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2020-07-01 11:06:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-07-01 11:06:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 75. [2020-07-01 11:06:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-01 11:06:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 130 transitions. [2020-07-01 11:06:14,601 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 130 transitions. Word has length 18 [2020-07-01 11:06:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:14,601 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 130 transitions. [2020-07-01 11:06:14,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 11:06:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 130 transitions. [2020-07-01 11:06:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 11:06:14,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:14,603 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:14,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-07-01 11:06:14,803 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash -582680000, now seen corresponding path program 2 times [2020-07-01 11:06:14,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:14,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45601260] [2020-07-01 11:06:14,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:14,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45601260] [2020-07-01 11:06:14,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262959122] [2020-07-01 11:06:14,996 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:06:15,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:15,039 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 11:06:15,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:15,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:15,047 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:15,051 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:15,051 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:15,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:06:15,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:06:15,069 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:15,071 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:15,072 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:15,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:06:15,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:15,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 11:06:15,108 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:15,109 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:15,116 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:15,116 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:15,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 11:06:15,137 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:06:15,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:15,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 11:06:15,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838398875] [2020-07-01 11:06:15,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 11:06:15,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 11:06:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-07-01 11:06:15,151 INFO L87 Difference]: Start difference. First operand 75 states and 130 transitions. Second operand 13 states. [2020-07-01 11:06:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:15,743 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2020-07-01 11:06:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 11:06:15,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-07-01 11:06:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:15,744 INFO L225 Difference]: With dead ends: 129 [2020-07-01 11:06:15,744 INFO L226 Difference]: Without dead ends: 128 [2020-07-01 11:06:15,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2020-07-01 11:06:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-01 11:06:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 60. [2020-07-01 11:06:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-01 11:06:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 94 transitions. [2020-07-01 11:06:15,757 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 94 transitions. Word has length 23 [2020-07-01 11:06:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:15,757 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 94 transitions. [2020-07-01 11:06:15,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 11:06:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2020-07-01 11:06:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-01 11:06:15,758 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:15,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:15,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:15,960 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1199219754, now seen corresponding path program 2 times [2020-07-01 11:06:15,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:15,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070676200] [2020-07-01 11:06:15,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:16,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070676200] [2020-07-01 11:06:16,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805129908] [2020-07-01 11:06:16,243 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:16,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:06:16,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:16,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 11:06:16,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:16,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:16,315 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,322 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,322 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,322 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:06:16,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:06:16,350 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,355 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,355 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-01 11:06:16,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:16,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:06:16,386 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,398 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,399 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:16,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2020-07-01 11:06:16,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:16,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:06:16,436 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,446 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,448 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:16,448 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2020-07-01 11:06:16,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:16,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:06:16,518 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:16,519 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:16,531 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:16,532 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:16,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:23 [2020-07-01 11:06:16,562 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:06:16,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:16,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-07-01 11:06:16,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929010268] [2020-07-01 11:06:16,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 11:06:16,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:16,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 11:06:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 11:06:16,619 INFO L87 Difference]: Start difference. First operand 60 states and 94 transitions. Second operand 17 states. [2020-07-01 11:06:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:18,781 INFO L93 Difference]: Finished difference Result 314 states and 493 transitions. [2020-07-01 11:06:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-01 11:06:18,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-07-01 11:06:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:18,784 INFO L225 Difference]: With dead ends: 314 [2020-07-01 11:06:18,784 INFO L226 Difference]: Without dead ends: 313 [2020-07-01 11:06:18,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2020-07-01 11:06:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-07-01 11:06:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 166. [2020-07-01 11:06:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-07-01 11:06:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2020-07-01 11:06:18,817 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 28 [2020-07-01 11:06:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:18,817 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2020-07-01 11:06:18,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 11:06:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2020-07-01 11:06:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-01 11:06:18,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:18,818 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:19,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:19,019 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199947, now seen corresponding path program 2 times [2020-07-01 11:06:19,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:19,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025669570] [2020-07-01 11:06:19,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:19,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025669570] [2020-07-01 11:06:19,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174155180] [2020-07-01 11:06:19,239 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:19,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:06:19,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:06:19,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 56 conjunts are in the unsatisfiable core [2020-07-01 11:06:19,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:19,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:19,294 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,299 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:19,303 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,308 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,308 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,309 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-07-01 11:06:19,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:06:19,331 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,341 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,341 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,342 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:06:19,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:19,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:06:19,383 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,391 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:06:19,399 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,406 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,407 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2020-07-01 11:06:19,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:06:19,435 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,444 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,444 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:19,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-07-01 11:06:19,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:06:19,564 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:19,564 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:19,575 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:19,576 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:19,773 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:29 [2020-07-01 11:06:19,840 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:19,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:19,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-07-01 11:06:19,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114994386] [2020-07-01 11:06:19,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 11:06:19,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:19,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 11:06:19,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-01 11:06:19,935 INFO L87 Difference]: Start difference. First operand 166 states and 261 transitions. Second operand 19 states. [2020-07-01 11:06:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:21,865 INFO L93 Difference]: Finished difference Result 258 states and 395 transitions. [2020-07-01 11:06:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-01 11:06:21,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-07-01 11:06:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:21,867 INFO L225 Difference]: With dead ends: 258 [2020-07-01 11:06:21,867 INFO L226 Difference]: Without dead ends: 257 [2020-07-01 11:06:21,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=420, Invalid=1140, Unknown=0, NotChecked=0, Total=1560 [2020-07-01 11:06:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-01 11:06:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 131. [2020-07-01 11:06:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-01 11:06:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 218 transitions. [2020-07-01 11:06:21,892 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 218 transitions. Word has length 28 [2020-07-01 11:06:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:21,893 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 218 transitions. [2020-07-01 11:06:21,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 11:06:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 218 transitions. [2020-07-01 11:06:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-01 11:06:21,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:21,894 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:22,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 11:06:22,095 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash 695961875, now seen corresponding path program 1 times [2020-07-01 11:06:22,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:22,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793511653] [2020-07-01 11:06:22,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 11:06:22,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793511653] [2020-07-01 11:06:22,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104054348] [2020-07-01 11:06:22,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:22,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 11:06:22,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:22,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:22,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2020-07-01 11:06:22,349 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:06:22,350 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 11:06:22,350 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:22,363 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:22,364 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:22,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2020-07-01 11:06:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 11:06:22,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:06:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2020-07-01 11:06:22,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162149723] [2020-07-01 11:06:22,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:06:22,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:06:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-07-01 11:06:22,384 INFO L87 Difference]: Start difference. First operand 131 states and 218 transitions. Second operand 8 states. [2020-07-01 11:06:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:23,151 INFO L93 Difference]: Finished difference Result 373 states and 636 transitions. [2020-07-01 11:06:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 11:06:23,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2020-07-01 11:06:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:23,153 INFO L225 Difference]: With dead ends: 373 [2020-07-01 11:06:23,154 INFO L226 Difference]: Without dead ends: 290 [2020-07-01 11:06:23,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2020-07-01 11:06:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-07-01 11:06:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 221. [2020-07-01 11:06:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-07-01 11:06:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 405 transitions. [2020-07-01 11:06:23,188 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 405 transitions. Word has length 38 [2020-07-01 11:06:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:23,188 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 405 transitions. [2020-07-01 11:06:23,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:06:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 405 transitions. [2020-07-01 11:06:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-01 11:06:23,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:23,189 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:23,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:23,390 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:23,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash 695962836, now seen corresponding path program 1 times [2020-07-01 11:06:23,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:23,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676982504] [2020-07-01 11:06:23,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:06:23,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676982504] [2020-07-01 11:06:23,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199281702] [2020-07-01 11:06:23,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:23,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-01 11:06:23,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:23,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:23,597 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,604 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,604 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,604 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-01 11:06:23,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:06:23,616 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,622 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,622 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:06:23,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:23,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:06:23,636 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,647 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,648 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:23,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-07-01 11:06:23,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:23,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:06:23,684 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,702 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,703 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:23,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 11:06:23,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 11:06:23,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:06:23,791 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:23,792 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:23,807 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:23,808 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:23,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-07-01 11:06:23,832 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-01 11:06:23,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:23,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-01 11:06:23,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951521594] [2020-07-01 11:06:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 11:06:23,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 11:06:23,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-01 11:06:23,890 INFO L87 Difference]: Start difference. First operand 221 states and 405 transitions. Second operand 15 states. [2020-07-01 11:06:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:24,882 INFO L93 Difference]: Finished difference Result 534 states and 917 transitions. [2020-07-01 11:06:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-01 11:06:24,882 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-01 11:06:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:24,884 INFO L225 Difference]: With dead ends: 534 [2020-07-01 11:06:24,884 INFO L226 Difference]: Without dead ends: 273 [2020-07-01 11:06:24,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-07-01 11:06:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-01 11:06:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 140. [2020-07-01 11:06:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-01 11:06:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 240 transitions. [2020-07-01 11:06:24,913 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 240 transitions. Word has length 38 [2020-07-01 11:06:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:24,913 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 240 transitions. [2020-07-01 11:06:24,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 11:06:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 240 transitions. [2020-07-01 11:06:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-01 11:06:24,914 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:06:24,914 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:25,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 11:06:25,115 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 11:06:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1648704205, now seen corresponding path program 1 times [2020-07-01 11:06:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:25,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258080765] [2020-07-01 11:06:25,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 11:06:25,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258080765] [2020-07-01 11:06:25,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604997050] [2020-07-01 11:06:25,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:06:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:25,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 56 conjunts are in the unsatisfiable core [2020-07-01 11:06:25,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:06:25,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:25,336 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,344 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:06:25,349 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,357 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,358 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-07-01 11:06:25,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:06:25,381 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,387 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,387 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-07-01 11:06:25,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-01 11:06:25,427 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,439 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-07-01 11:06:25,443 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,454 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,455 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,455 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2020-07-01 11:06:25,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 11:06:25,491 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:06:25,506 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,507 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:25,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2020-07-01 11:06:25,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 11:06:25,669 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:25,670 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:06:25,687 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:06:25,688 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:06:25,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:29 [2020-07-01 11:06:25,725 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:06:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 11:06:25,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:06:25,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2020-07-01 11:06:25,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268864947] [2020-07-01 11:06:25,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 11:06:25,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 11:06:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2020-07-01 11:06:25,816 INFO L87 Difference]: Start difference. First operand 140 states and 240 transitions. Second operand 19 states. [2020-07-01 11:06:26,344 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-07-01 11:06:26,914 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-07-01 11:06:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:26,940 INFO L93 Difference]: Finished difference Result 140 states and 240 transitions. [2020-07-01 11:06:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-01 11:06:26,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2020-07-01 11:06:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:06:26,941 INFO L225 Difference]: With dead ends: 140 [2020-07-01 11:06:26,941 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:06:26,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2020-07-01 11:06:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:06:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:06:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:06:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:06:26,943 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-01 11:06:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:06:26,943 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:06:26,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 11:06:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:06:26,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:06:27,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 11:06:27,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:06:28,608 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 424 DAG size of output: 390 [2020-07-01 11:06:29,978 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 435 DAG size of output: 402 [2020-07-01 11:06:34,585 WARN L192 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 387 DAG size of output: 94 [2020-07-01 11:06:45,807 WARN L192 SmtUtils]: Spent 11.22 s on a formula simplification. DAG size of input: 393 DAG size of output: 112 [2020-07-01 11:06:46,303 WARN L192 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 30 [2020-07-01 11:06:46,308 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-07-01 11:06:46,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 34) no Hoare annotation was computed. [2020-07-01 11:06:46,308 INFO L268 CegarLoopResult]: For program point L31-1(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,308 INFO L268 CegarLoopResult]: For program point L31-2(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,309 INFO L268 CegarLoopResult]: For program point L31-3(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,309 INFO L268 CegarLoopResult]: For program point L31-4(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,309 INFO L268 CegarLoopResult]: For program point L31-6(lines 31 32) no Hoare annotation was computed. [2020-07-01 11:06:46,309 INFO L264 CegarLoopResult]: At program point L31-8(lines 31 32) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base)) (.cse16 (select |#length| |ULTIMATE.start_main_#t~ret10.base|))) (and (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 2) .cse0) (= (select (select |#memory_int| ULTIMATE.start_cstrcspn_~sc1~0.base) (+ .cse0 (- 1))) 0) (let ((.cse17 (select |#length| ULTIMATE.start_cstrcspn_~s2.base))) (let ((.cse1 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s~0.base))) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse4 (<= 1 .cse17)) (.cse5 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|))) (.cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ .cse17 (- 1))))) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse8 (<= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset)) (.cse9 (<= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~sc1~0.base)) (.cse10 (= 0 |ULTIMATE.start_main_#t~ret10.offset|)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~sc1~0.base))) (.cse12 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse13 (<= ULTIMATE.start_cstrcspn_~sc1~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse2 (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (.cse15 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse14 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)))) (or (and .cse1 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ .cse2 (- 1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((v_prenex_2 Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) v_prenex_2)) (<= (+ v_prenex_2 1) (select |#length| |ULTIMATE.start_main_#t~ret10.base|)) (<= |ULTIMATE.start_main_#t~ret10.offset| v_prenex_2))) .cse9 .cse10 .cse11 .cse12 .cse13 (or (and (< 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse14) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse14)) .cse15 (<= 1 ULTIMATE.start_cstrcspn_~s~0.offset) (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) .cse2)) (and .cse1 (<= 1 .cse16) .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 1 .cse2) (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_cstrcspn_~s~0.offset ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrcspn_~s~0.base) (- 1)))))) .cse15 .cse14 (= 0 ULTIMATE.start_cstrcspn_~s~0.offset) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) (+ .cse16 (- 1)))))) [2020-07-01 11:06:46,309 INFO L268 CegarLoopResult]: For program point L31-9(lines 31 32) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point L28-1(lines 28 35) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 36) no Hoare annotation was computed. [2020-07-01 11:06:46,310 INFO L268 CegarLoopResult]: For program point L28-3(lines 28 35) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L264 CegarLoopResult]: At program point L28-4(lines 28 35) the Hoare annotation is: (let ((.cse26 (select |#length| |ULTIMATE.start_main_#t~ret10.base|)) (.cse31 (select |#length| ULTIMATE.start_cstrcspn_~s2.base)) (.cse30 (select |#length| ULTIMATE.start_cstrcspn_~s~0.base)) (.cse28 (select |#length| ULTIMATE.start_cstrcspn_~sc1~0.base))) (let ((.cse16 (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 1) .cse28)) (.cse22 (<= (+ ULTIMATE.start_cstrcspn_~sc1~0.offset 2) .cse28)) (.cse1 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s~0.base) (+ .cse30 (- 1))))) (.cse19 (or (< 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) (.cse7 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcspn_~s2.base) (+ .cse31 (- 1))))) (.cse23 (= 1 ULTIMATE.start_cstrcspn_~sc1~0.offset)) (.cse25 (= 0 ULTIMATE.start_cstrcspn_~sc1~0.offset)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s~0.base))) (.cse2 (<= 1 .cse26)) (.cse3 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~s2.base))) (.cse4 (<= 1 .cse31)) (.cse5 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|))) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse9 (<= ULTIMATE.start_cstrcspn_~s1.base ULTIMATE.start_cstrcspn_~sc1~0.base)) (.cse10 (= 0 |ULTIMATE.start_main_#t~ret10.offset|)) (.cse11 (<= 1 ULTIMATE.start_cstrcspn_~sc1~0.offset)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrcspn_~sc1~0.base))) (.cse13 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse14 (<= 0 ULTIMATE.start_cstrcspn_~s~0.offset)) (.cse15 (<= ULTIMATE.start_cstrcspn_~sc1~0.base ULTIMATE.start_cstrcspn_~s1.base)) (.cse18 (= 0 ULTIMATE.start_cstrcspn_~s2.offset)) (.cse21 (<= (+ ULTIMATE.start_cstrcspn_~s~0.offset 1) .cse30)) (.cse27 (select |#memory_int| ULTIMATE.start_cstrcspn_~sc1~0.base))) (let ((.cse8 (= (select .cse27 (+ .cse28 (- 1))) 0)) (.cse24 (let ((.cse29 (or (and .cse9 .cse10 .cse12 .cse13 .cse15 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse25) (and .cse0 .cse2 .cse3 .cse4 (< ULTIMATE.start_cstrcspn_~sc1~0.base 0) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 (<= (+ |ULTIMATE.start_main_#t~ret10.base| 1) 0) .cse13 .cse14 .cse15 (exists ((|ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base| Int)) (and (<= |ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (< 0 |ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base|) (= ULTIMATE.start___VERIFIER_nondet_String_~length~0 (select |#length| |ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base|)))) .cse18 .cse21) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base 1) 0) .cse18 .cse21)))) (or (and (or (= (select .cse27 ULTIMATE.start_cstrcspn_~sc1~0.offset) 0) (and (<= 2 .cse28) .cse25)) .cse29 .cse16 .cse19 .cse7) (and .cse22 .cse1 .cse29 .cse19 .cse7 .cse23 (< ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base 0))))) (.cse17 (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) (+ .cse26 (- 1))))) (.cse20 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse8 (or .cse22 .cse23) .cse24 .cse17 .cse20) (and .cse8 .cse24 .cse17 .cse20 .cse25))))) [2020-07-01 11:06:46,311 INFO L268 CegarLoopResult]: For program point L28-5(lines 28 35) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) [2020-07-01 11:06:46,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 11:06:46,311 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (select |#length| |ULTIMATE.start_main_#t~ret10.base|))) (and (= 0 |ULTIMATE.start_main_#t~ret10.offset|) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 1 .cse0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) (+ .cse0 (- 1)))) (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|)) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:06:46,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:06:46,313 INFO L268 CegarLoopResult]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:06:46,313 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 11:06:46,313 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:06:46,313 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:06:46,316 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:06:46,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,330 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,387 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,420 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,440 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,442 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:46 BasicIcfg [2020-07-01 11:06:46,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:06:46,444 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:06:46,444 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:06:46,448 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:06:46,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:46,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:05:59" (1/5) ... [2020-07-01 11:06:46,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74793536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:06:46, skipping insertion in model container [2020-07-01 11:06:46,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:46,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:05:59" (2/5) ... [2020-07-01 11:06:46,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74793536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:06:46, skipping insertion in model container [2020-07-01 11:06:46,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:46,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:06:00" (3/5) ... [2020-07-01 11:06:46,450 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74793536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:06:46, skipping insertion in model container [2020-07-01 11:06:46,450 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:46,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:06:00" (4/5) ... [2020-07-01 11:06:46,451 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74793536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:06:46, skipping insertion in model container [2020-07-01 11:06:46,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:06:46,451 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:06:46" (5/5) ... [2020-07-01 11:06:46,452 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:06:46,474 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:06:46,474 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:06:46,474 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:06:46,474 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:06:46,474 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:06:46,474 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:06:46,474 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:06:46,474 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:06:46,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-01 11:06:46,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 11:06:46,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:46,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:46,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:46,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:46,488 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:06:46,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-01 11:06:46,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 11:06:46,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:06:46,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:06:46,490 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:46,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:06:46,496 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue [242] ULTIMATE.startENTRY-->L12: Formula: (and (< 0 |v_#StackHeapBarrier_4|) (= 0 |v_#NULL.base_2|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_21| (store |v_#valid_22| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 19#L12true [109] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 15#L12-2true [173] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| |v_#StackHeapBarrier_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [244] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (<= 1 .cse0) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 33#L12-3true [150] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 31#L12-5true [179] L12-5-->L16-2: Formula: (and (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= 0 (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| |v_#StackHeapBarrier_3|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 24#L16-2true [246] L16-2-->L28-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrcspn_~s1.offset_5 |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrcspn_#in~s2.base_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start_main_#t~ret11.offset_5| |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrcspn_#in~s2.offset_2| v_ULTIMATE.start_cstrcspn_~s2.offset_4) (= |v_ULTIMATE.start_cstrcspn_#in~s2.base_2| v_ULTIMATE.start_cstrcspn_~s2.base_4) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_main_#t~ret10.offset_7| |v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcspn_~sc1~0.base_16 v_ULTIMATE.start_cstrcspn_~s1.base_7) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= v_ULTIMATE.start_cstrcspn_~s1.offset_5 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_12) (= |v_ULTIMATE.start_cstrcspn_#in~s1.base_2| v_ULTIMATE.start_cstrcspn_~s1.base_7) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_4|, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_16, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrcspn_~s1.offset=v_ULTIMATE.start_cstrcspn_~s1.offset_5, ULTIMATE.start_cstrcspn_#t~post8.base=|v_ULTIMATE.start_cstrcspn_#t~post8.base_4|, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_4, ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_10|, ULTIMATE.start_cstrcspn_#in~s2.base=|v_ULTIMATE.start_cstrcspn_#in~s2.base_2|, ULTIMATE.start_cstrcspn_#in~s1.base=|v_ULTIMATE.start_cstrcspn_#in~s1.base_2|, #length=|v_#length_22|, ULTIMATE.start_cstrcspn_#in~s1.offset=|v_ULTIMATE.start_cstrcspn_#in~s1.offset_2|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_12, ULTIMATE.start_cstrcspn_#t~post8.offset=|v_ULTIMATE.start_cstrcspn_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_12, ULTIMATE.start_cstrcspn_#t~mem6=|v_ULTIMATE.start_cstrcspn_#t~mem6_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcspn_#t~mem4=|v_ULTIMATE.start_cstrcspn_#t~mem4_5|, ULTIMATE.start_cstrcspn_#t~mem5=|v_ULTIMATE.start_cstrcspn_#t~mem5_6|, ULTIMATE.start_cstrcspn_#t~mem9=|v_ULTIMATE.start_cstrcspn_#t~mem9_7|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrcspn_~s1.base=v_ULTIMATE.start_cstrcspn_~s1.base_7, ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_4, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_4|, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_7|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start_cstrcspn_#in~s2.offset=|v_ULTIMATE.start_cstrcspn_#in~s2.offset_2|, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_15, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_cstrcspn_#res=|v_ULTIMATE.start_cstrcspn_#res_5|, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~sc1~0.base, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrcspn_~s1.offset, ULTIMATE.start_cstrcspn_#t~post8.base, ULTIMATE.start_cstrcspn_~s2.offset, ULTIMATE.start_cstrcspn_#t~short7, ULTIMATE.start_cstrcspn_#in~s2.base, ULTIMATE.start_cstrcspn_#in~s1.base, ULTIMATE.start_cstrcspn_#in~s1.offset, ULTIMATE.start_cstrcspn_~sc1~0.offset, ULTIMATE.start_cstrcspn_#t~post8.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_cstrcspn_#t~mem6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcspn_#t~mem4, ULTIMATE.start_cstrcspn_#t~mem5, ULTIMATE.start_cstrcspn_#t~mem9, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrcspn_~s1.base, ULTIMATE.start_cstrcspn_~s2.base, ULTIMATE.start_cstrcspn_#t~post2.offset, ULTIMATE.start_cstrcspn_#t~mem3, ULTIMATE.start_cstrcspn_#in~s2.offset, ULTIMATE.start_cstrcspn_~s~0.base, #memory_int, ULTIMATE.start_cstrcspn_#res, ULTIMATE.start_cstrcspn_~c~0] 38#L28-4true [2020-07-01 11:06:46,497 INFO L796 eck$LassoCheckResult]: Loop: 38#L28-4true [141] L28-4-->L28-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4) 1) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrcspn_#t~mem3_2|) (<= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrcspn_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_4, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem3] 28#L28-1true [188] L28-1-->L30: Formula: (and (= v_ULTIMATE.start_cstrcspn_~s~0.offset_3 v_ULTIMATE.start_cstrcspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrcspn_#t~mem3_6|) (= v_ULTIMATE.start_cstrcspn_~s~0.base_3 v_ULTIMATE.start_cstrcspn_~s2.base_3)) InVars {ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_3, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_3, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_6|} OutVars{ULTIMATE.start_cstrcspn_~s2.base=v_ULTIMATE.start_cstrcspn_~s2.base_3, ULTIMATE.start_cstrcspn_~s2.offset=v_ULTIMATE.start_cstrcspn_~s2.offset_3, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_3, ULTIMATE.start_cstrcspn_#t~mem3=|v_ULTIMATE.start_cstrcspn_#t~mem3_5|, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_~s~0.base, ULTIMATE.start_cstrcspn_~s~0.offset, ULTIMATE.start_cstrcspn_#t~mem3] 32#L30true [247] L30-->L31-8: Formula: (and (= v_ULTIMATE.start_cstrcspn_~c~0_8 (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13)) (<= 0 v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13) (<= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13 1) (select |v_#length_23| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrcspn_~sc1~0.base_17))) InVars {ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_17, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, #length=|v_#length_23|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13} OutVars{ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_17, ULTIMATE.start_cstrcspn_#t~mem4=|v_ULTIMATE.start_cstrcspn_#t~mem4_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, #length=|v_#length_23|, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_13, ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_8} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem4, ULTIMATE.start_cstrcspn_~c~0] 20#L31-8true [112] L31-8-->L31-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrcspn_~s~0.base_4)) (= |v_ULTIMATE.start_cstrcspn_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcspn_~s~0.base_4) v_ULTIMATE.start_cstrcspn_~s~0.offset_4)) (<= 0 v_ULTIMATE.start_cstrcspn_~s~0.offset_4) (<= (+ v_ULTIMATE.start_cstrcspn_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrcspn_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_4, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcspn_#t~mem5=|v_ULTIMATE.start_cstrcspn_#t~mem5_2|, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem5] 12#L31-1true [212] L31-1-->L31-2: Formula: (and (> 0 |v_ULTIMATE.start_cstrcspn_#t~mem5_3|) |v_ULTIMATE.start_cstrcspn_#t~short7_2|) InVars {ULTIMATE.start_cstrcspn_#t~mem5=|v_ULTIMATE.start_cstrcspn_#t~mem5_3|} OutVars{ULTIMATE.start_cstrcspn_#t~mem5=|v_ULTIMATE.start_cstrcspn_#t~mem5_3|, ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~short7] 10#L31-2true [101] L31-2-->L31-6: Formula: (not |v_ULTIMATE.start_cstrcspn_#t~short7_5|) InVars {ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_5|} OutVars{ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_5|} AuxVars[] AssignedVars[] 26#L31-6true [122] L31-6-->L31-9: Formula: (not |v_ULTIMATE.start_cstrcspn_#t~short7_7|) InVars {ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_7|} OutVars{ULTIMATE.start_cstrcspn_#t~mem6=|v_ULTIMATE.start_cstrcspn_#t~mem6_4|, ULTIMATE.start_cstrcspn_#t~mem5=|v_ULTIMATE.start_cstrcspn_#t~mem5_4|, ULTIMATE.start_cstrcspn_#t~short7=|v_ULTIMATE.start_cstrcspn_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem6, ULTIMATE.start_cstrcspn_#t~mem5, ULTIMATE.start_cstrcspn_#t~short7] 17#L31-9true [106] L31-9-->L33: Formula: (and (<= 0 v_ULTIMATE.start_cstrcspn_~s~0.offset_10) (<= (+ v_ULTIMATE.start_cstrcspn_~s~0.offset_10 1) (select |v_#length_17| v_ULTIMATE.start_cstrcspn_~s~0.base_12)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_cstrcspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrcspn_#t~mem9_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrcspn_~s~0.base_12) v_ULTIMATE.start_cstrcspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_10, ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_12, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_cstrcspn_~s~0.base=v_ULTIMATE.start_cstrcspn_~s~0.base_12, ULTIMATE.start_cstrcspn_#t~mem9=|v_ULTIMATE.start_cstrcspn_#t~mem9_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_9|, #length=|v_#length_17|, ULTIMATE.start_cstrcspn_~s~0.offset=v_ULTIMATE.start_cstrcspn_~s~0.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem9] 36#L33true [215] L33-->L28-3: Formula: (< v_ULTIMATE.start_cstrcspn_~c~0_6 |v_ULTIMATE.start_cstrcspn_#t~mem9_6|) InVars {ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6, ULTIMATE.start_cstrcspn_#t~mem9=|v_ULTIMATE.start_cstrcspn_#t~mem9_6|} OutVars{ULTIMATE.start_cstrcspn_~c~0=v_ULTIMATE.start_cstrcspn_~c~0_6, ULTIMATE.start_cstrcspn_#t~mem9=|v_ULTIMATE.start_cstrcspn_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~mem9] 39#L28-3true [145] L28-3-->L28-4: Formula: (and (= v_ULTIMATE.start_cstrcspn_~sc1~0.base_13 v_ULTIMATE.start_cstrcspn_~sc1~0.base_12) (= (+ v_ULTIMATE.start_cstrcspn_~sc1~0.offset_10 1) v_ULTIMATE.start_cstrcspn_~sc1~0.offset_9)) InVars {ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_10, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_13} OutVars{ULTIMATE.start_cstrcspn_#t~post2.base=|v_ULTIMATE.start_cstrcspn_#t~post2.base_2|, ULTIMATE.start_cstrcspn_~sc1~0.base=v_ULTIMATE.start_cstrcspn_~sc1~0.base_12, ULTIMATE.start_cstrcspn_~sc1~0.offset=v_ULTIMATE.start_cstrcspn_~sc1~0.offset_9, ULTIMATE.start_cstrcspn_#t~post2.offset=|v_ULTIMATE.start_cstrcspn_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcspn_#t~post2.base, ULTIMATE.start_cstrcspn_~sc1~0.base, ULTIMATE.start_cstrcspn_~sc1~0.offset, ULTIMATE.start_cstrcspn_#t~post2.offset] 38#L28-4true [2020-07-01 11:06:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 763134582, now seen corresponding path program 1 times [2020-07-01 11:06:46,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:46,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571827942] [2020-07-01 11:06:46,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:06:46,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:06:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:06:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -769555324, now seen corresponding path program 1 times [2020-07-01 11:06:46,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:06:46,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312831964] [2020-07-01 11:06:46,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:06:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:06:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:06:46,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312831964] [2020-07-01 11:06:46,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:06:46,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:06:46,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777355745] [2020-07-01 11:06:46,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 11:06:46,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:06:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:06:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:06:46,548 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-01 11:06:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:06:46,672 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2020-07-01 11:06:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:06:46,675 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 11:06:46,679 INFO L168 Benchmark]: Toolchain (without parser) took 47117.99 ms. Allocated memory was 649.6 MB in the beginning and 1.4 GB in the end (delta: 706.7 MB). Free memory was 560.0 MB in the beginning and 1.3 GB in the end (delta: -706.4 MB). Peak memory consumption was 353.1 kB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,680 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:06:46,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.07 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 560.0 MB in the beginning and 628.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.03 ms. Allocated memory is still 665.8 MB. Free memory was 628.7 MB in the beginning and 626.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,681 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 665.8 MB. Free memory was 626.4 MB in the beginning and 624.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,681 INFO L168 Benchmark]: RCFGBuilder took 375.59 ms. Allocated memory is still 665.8 MB. Free memory was 624.3 MB in the beginning and 596.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,682 INFO L168 Benchmark]: BlockEncodingV2 took 147.70 ms. Allocated memory is still 665.8 MB. Free memory was 596.6 MB in the beginning and 583.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,682 INFO L168 Benchmark]: TraceAbstraction took 45972.17 ms. Allocated memory was 665.8 MB in the beginning and 1.4 GB in the end (delta: 690.5 MB). Free memory was 583.6 MB in the beginning and 1.3 GB in the end (delta: -702.4 MB). Peak memory consumption was 807.9 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,682 INFO L168 Benchmark]: BuchiAutomizer took 233.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 50.3 GB. [2020-07-01 11:06:46,684 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 54 edges - StatisticsResult: Encoded RCFG 37 locations, 73 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 309.07 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 560.0 MB in the beginning and 628.7 MB in the end (delta: -68.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.03 ms. Allocated memory is still 665.8 MB. Free memory was 628.7 MB in the beginning and 626.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 665.8 MB. Free memory was 626.4 MB in the beginning and 624.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 375.59 ms. Allocated memory is still 665.8 MB. Free memory was 624.3 MB in the beginning and 596.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 147.70 ms. Allocated memory is still 665.8 MB. Free memory was 596.6 MB in the beginning and 583.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 45972.17 ms. Allocated memory was 665.8 MB in the beginning and 1.4 GB in the end (delta: 690.5 MB). Free memory was 583.6 MB in the beginning and 1.3 GB in the end (delta: -702.4 MB). Peak memory consumption was 807.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 233.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:06:46,698 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,698 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((nondetString == 0 && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length - InvariantResult [Line: 31]: Loop Invariant [2020-07-01 11:06:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,700 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2020-07-01 11:06:46,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:06:46,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((sc1 + 2 <= unknown-#length-unknown[sc1] && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && ((((((((((((((((((1 == \valid[s] && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 <= sc1) && (\exists v_prenex_2 : int :: (0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][v_prenex_2] && v_prenex_2 + 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && __VERIFIER_nondet_String() <= v_prenex_2)) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && ((1 < length && 1 == \valid[nondetString]) || (1 == length && 1 == \valid[nondetString]))) && 0 == s2) && 1 <= s) && s + 1 <= unknown-#length-unknown[s]) || ((((((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && unknown-#length-unknown[nondetString] == length) && 0 <= sc1) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && 1 <= unknown-#length-unknown[s]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (s <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset && ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1])) && 0 == s2) && 1 == \valid[nondetString]) && 0 == s) && 1 <= length))) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] - InvariantResult [Line: 28]: Loop Invariant [2020-07-01 11:06:46,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,719 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,726 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,727 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,729 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,730 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,731 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,732 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,732 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,732 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,732 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,734 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,738 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base,QUANTIFIED] [2020-07-01 11:06:46,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,758 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,759 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,760 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,764 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((((1 == \valid[s] && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && nondetString == 0) && 0 <= s) && sc1 <= s1) && sc1 + 1 <= unknown-#length-unknown[sc1]) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1]) && 0 == s2) && (1 < length || 1 == length)) && 1 == \valid[nondetString]) && s + 1 <= unknown-#length-unknown[s]) || ((((unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0 && (sc1 + 2 <= unknown-#length-unknown[sc1] || 1 == sc1)) && ((((((unknown-#memory_int-unknown[sc1][sc1] == 0 || (2 <= unknown-#length-unknown[sc1] && 0 == sc1)) && (((((((((((((s1 <= sc1 && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == sc1) || (((((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && sc1 < 0) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && __VERIFIER_nondet_String() + 1 <= 0) && nondetString == 0) && 0 <= s) && sc1 <= s1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base : int :: (ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base <= nondetString && 0 < ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base) && length == unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base])) && 0 == s2) && s + 1 <= unknown-#length-unknown[s])) || (((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && nondetString == 0) && 0 <= s) && sc1 <= s1) && nondetString + 1 <= 0) && 0 == s2) && s + 1 <= unknown-#length-unknown[s]))) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (1 < length || 1 == length)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) || ((((((sc1 + 2 <= unknown-#length-unknown[sc1] && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && (((((((((((((s1 <= sc1 && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == sc1) || (((((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && sc1 < 0) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && __VERIFIER_nondet_String() + 1 <= 0) && nondetString == 0) && 0 <= s) && sc1 <= s1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base : int :: (ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base <= nondetString && 0 < ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base) && length == unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base])) && 0 == s2) && s + 1 <= unknown-#length-unknown[s])) || (((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && nondetString == 0) && 0 <= s) && sc1 <= s1) && nondetString + 1 <= 0) && 0 == s2) && s + 1 <= unknown-#length-unknown[s]))) && (1 < length || 1 == length)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == sc1) && nondetString < 0))) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1]) && 1 == \valid[nondetString])) || ((((unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0 && ((((((unknown-#memory_int-unknown[sc1][sc1] == 0 || (2 <= unknown-#length-unknown[sc1] && 0 == sc1)) && (((((((((((((s1 <= sc1 && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == sc1) || (((((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && sc1 < 0) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && __VERIFIER_nondet_String() + 1 <= 0) && nondetString == 0) && 0 <= s) && sc1 <= s1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base : int :: (ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base <= nondetString && 0 < ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base) && length == unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base])) && 0 == s2) && s + 1 <= unknown-#length-unknown[s])) || (((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && nondetString == 0) && 0 <= s) && sc1 <= s1) && nondetString + 1 <= 0) && 0 == s2) && s + 1 <= unknown-#length-unknown[s]))) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (1 < length || 1 == length)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) || ((((((sc1 + 2 <= unknown-#length-unknown[sc1] && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && (((((((((((((s1 <= sc1 && 0 == __VERIFIER_nondet_String()) && 1 == \valid[sc1]) && nondetString == 0) && sc1 <= s1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 0 == s2) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && 0 == sc1) || (((((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && sc1 < 0) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && __VERIFIER_nondet_String() + 1 <= 0) && nondetString == 0) && 0 <= s) && sc1 <= s1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base : int :: (ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base <= nondetString && 0 < ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base) && length == unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base])) && 0 == s2) && s + 1 <= unknown-#length-unknown[s])) || (((((((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && s1 <= sc1) && 0 == __VERIFIER_nondet_String()) && 1 <= sc1) && 1 == \valid[sc1]) && nondetString == 0) && 0 <= s) && sc1 <= s1) && nondetString + 1 <= 0) && 0 == s2) && s + 1 <= unknown-#length-unknown[s]))) && (1 < length || 1 == length)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == sc1) && nondetString < 0))) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1]) && 1 == \valid[nondetString]) && 0 == sc1) - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:06:46,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:06:46,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:06:46,768 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((0 == __VERIFIER_nondet_String() && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1]) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 == \valid[nondetString]) && unknown-#length-unknown[nondetString] == length) && 1 <= length - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.6s, OverallIterations: 27, TraceHistogramMax: 3, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 322 SDtfs, 6782 SDslu, 3064 SDs, 0 SdLazy, 5756 SolverSat, 712 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 1138 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 66 NumberOfFragments, 1497 HoareAnnotationTreeSize, 4 FomulaSimplifications, 259324770 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 10330717 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 679 ConstructedInterpolants, 113 QuantifiedInterpolants, 230702 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1632 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 38 InterpolantComputations, 19 PerfectInterpolantSequences, 92/275 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:06:46.992 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check