./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0b85db7f19d029ed27be7f6b92a191abc3110f8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 19:09:36,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 19:09:36,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 19:09:36,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 19:09:36,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 19:09:36,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 19:09:36,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 19:09:36,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 19:09:36,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 19:09:36,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 19:09:36,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 19:09:36,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 19:09:36,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 19:09:36,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 19:09:36,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 19:09:36,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 19:09:36,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 19:09:36,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 19:09:36,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 19:09:36,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 19:09:36,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 19:09:36,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 19:09:36,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 19:09:36,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 19:09:36,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 19:09:36,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 19:09:36,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 19:09:36,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 19:09:36,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 19:09:36,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 19:09:36,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 19:09:36,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 19:09:36,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 19:09:36,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 19:09:36,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 19:09:36,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 19:09:36,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 19:09:36,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 19:09:36,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 19:09:36,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 19:09:36,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 19:09:36,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-19 19:09:36,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 19:09:36,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 19:09:36,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 19:09:36,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 19:09:36,713 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 19:09:36,713 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 19:09:36,714 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 19:09:36,714 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 19:09:36,714 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 19:09:36,714 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 19:09:36,716 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 19:09:36,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 19:09:36,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-19 19:09:36,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 19:09:36,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 19:09:36,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-19 19:09:36,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 19:09:36,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 19:09:36,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 19:09:36,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 19:09:36,718 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-19 19:09:36,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 19:09:36,719 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 19:09:36,719 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 19:09:36,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 19:09:36,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 19:09:36,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 19:09:36,720 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 19:09:36,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 19:09:36,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 19:09:36,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 19:09:36,721 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 19:09:36,722 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 19:09:36,722 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0b85db7f19d029ed27be7f6b92a191abc3110f8 [2020-10-19 19:09:37,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 19:09:37,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 19:09:37,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 19:09:37,058 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 19:09:37,058 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 19:09:37,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-19 19:09:37,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b657f06/63693abfae18448185fffb211d843e39/FLAGfe4dd2bb5 [2020-10-19 19:09:37,686 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 19:09:37,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-19 19:09:37,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b657f06/63693abfae18448185fffb211d843e39/FLAGfe4dd2bb5 [2020-10-19 19:09:37,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b657f06/63693abfae18448185fffb211d843e39 [2020-10-19 19:09:37,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 19:09:37,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 19:09:37,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:37,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 19:09:37,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 19:09:37,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6381b8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:37, skipping insertion in model container [2020-10-19 19:09:37,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 07:09:37" (1/1) ... [2020-10-19 19:09:37,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 19:09:38,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 19:09:38,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:38,362 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 19:09:38,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 19:09:38,536 INFO L208 MainTranslator]: Completed translation [2020-10-19 19:09:38,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38 WrapperNode [2020-10-19 19:09:38,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 19:09:38,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:38,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 19:09:38,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 19:09:38,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 19:09:38,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 19:09:38,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 19:09:38,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 19:09:38,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... [2020-10-19 19:09:38,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 19:09:38,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 19:09:38,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 19:09:38,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 19:09:38,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 19:09:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 19:09:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 19:09:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-19 19:09:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-19 19:09:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 19:09:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-19 19:09:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 19:09:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-19 19:09:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 19:09:38,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 19:09:39,374 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 19:09:39,377 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-19 19:09:39,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:39 BoogieIcfgContainer [2020-10-19 19:09:39,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 19:09:39,380 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 19:09:39,380 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 19:09:39,386 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 19:09:39,387 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:39,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 07:09:37" (1/3) ... [2020-10-19 19:09:39,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca4be61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:39, skipping insertion in model container [2020-10-19 19:09:39,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:39,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 07:09:38" (2/3) ... [2020-10-19 19:09:39,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ca4be61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 07:09:39, skipping insertion in model container [2020-10-19 19:09:39,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 19:09:39,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:39" (3/3) ... [2020-10-19 19:09:39,392 INFO L373 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-19 19:09:39,432 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 19:09:39,432 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 19:09:39,432 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 19:09:39,432 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 19:09:39,433 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 19:09:39,433 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 19:09:39,433 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 19:09:39,433 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 19:09:39,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-19 19:09:39,474 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-19 19:09:39,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,482 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:39,482 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,482 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 19:09:39,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-19 19:09:39,487 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-19 19:09:39,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,487 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:39,488 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,496 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 14#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 8#L568-2true [2020-10-19 19:09:39,496 INFO L796 eck$LassoCheckResult]: Loop: 8#L568-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 32#L558-2true assume !true; 42#L557-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 18#L563true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 25#L563-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 4#L568true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 8#L568-2true [2020-10-19 19:09:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 19:09:39,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475923470] [2020-10-19 19:09:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,650 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,676 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-19 19:09:39,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121371547] [2020-10-19 19:09:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:39,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121371547] [2020-10-19 19:09:39,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:39,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 19:09:39,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143337542] [2020-10-19 19:09:39,722 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:09:39,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 19:09:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 19:09:39,742 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2020-10-19 19:09:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:39,752 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2020-10-19 19:09:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 19:09:39,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2020-10-19 19:09:39,757 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-19 19:09:39,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2020-10-19 19:09:39,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-19 19:09:39,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-19 19:09:39,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2020-10-19 19:09:39,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:39,765 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-19 19:09:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2020-10-19 19:09:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-19 19:09:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-19 19:09:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-19 19:09:39,796 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-19 19:09:39,796 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-19 19:09:39,796 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 19:09:39,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2020-10-19 19:09:39,800 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-19 19:09:39,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:39,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:39,801 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:39,801 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:39,801 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 120#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 102#L568-2 [2020-10-19 19:09:39,801 INFO L796 eck$LassoCheckResult]: Loop: 102#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 107#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 104#L557-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 105#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 115#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 122#L563 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 123#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 101#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 102#L568-2 [2020-10-19 19:09:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-19 19:09:39,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791316671] [2020-10-19 19:09:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:39,837 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:39,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-19 19:09:39,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:39,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664293759] [2020-10-19 19:09:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:39,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664293759] [2020-10-19 19:09:39,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:39,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:09:39,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318221356] [2020-10-19 19:09:39,982 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 19:09:39,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:09:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:09:39,984 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-10-19 19:09:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:40,146 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-10-19 19:09:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 19:09:40,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-10-19 19:09:40,150 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2020-10-19 19:09:40,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2020-10-19 19:09:40,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-19 19:09:40,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-19 19:09:40,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2020-10-19 19:09:40,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:40,154 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2020-10-19 19:09:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2020-10-19 19:09:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-19 19:09:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-19 19:09:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-19 19:09:40,160 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-19 19:09:40,161 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-19 19:09:40,161 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 19:09:40,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2020-10-19 19:09:40,162 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2020-10-19 19:09:40,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:40,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:40,163 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:40,163 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:40,164 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 209#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 193#L568-2 [2020-10-19 19:09:40,164 INFO L796 eck$LassoCheckResult]: Loop: 193#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 199#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 195#L557-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 196#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 229#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 214#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 215#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 192#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 193#L568-2 [2020-10-19 19:09:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-19 19:09:40,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398583745] [2020-10-19 19:09:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,205 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-19 19:09:40,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250853845] [2020-10-19 19:09:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,252 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-19 19:09:40,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761548357] [2020-10-19 19:09:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 19:09:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 19:09:40,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761548357] [2020-10-19 19:09:40,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 19:09:40,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-19 19:09:40,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316862596] [2020-10-19 19:09:40,526 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-19 19:09:40,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 19:09:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 19:09:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 19:09:40,589 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-10-19 19:09:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 19:09:40,926 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-10-19 19:09:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 19:09:40,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2020-10-19 19:09:40,929 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2020-10-19 19:09:40,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2020-10-19 19:09:40,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-19 19:09:40,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-19 19:09:40,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2020-10-19 19:09:40,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 19:09:40,933 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2020-10-19 19:09:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2020-10-19 19:09:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2020-10-19 19:09:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-19 19:09:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2020-10-19 19:09:40,939 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-19 19:09:40,940 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-19 19:09:40,940 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 19:09:40,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2020-10-19 19:09:40,941 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2020-10-19 19:09:40,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 19:09:40,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 19:09:40,942 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 19:09:40,942 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 19:09:40,942 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 358#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_#t~nondet31, main_#t~malloc35.base, main_#t~malloc35.offset, main_#t~mem36.base, main_#t~mem36.offset, main_#t~nondet34, main_#t~mem38.base, main_#t~mem38.offset, main_#t~mem37, main_#t~mem40.base, main_#t~mem40.offset, main_#t~mem39, main_#t~mem41, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 339#L568-2 [2020-10-19 19:09:40,943 INFO L796 eck$LassoCheckResult]: Loop: 339#L568-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 369#L558-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 342#L557-1 assume !main_#t~short9; 343#L557-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 383#L557-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 380#L563 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset; 381#L563-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 338#L568 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 339#L568-2 [2020-10-19 19:09:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-19 19:09:40,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470046602] [2020-10-19 19:09:40,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:40,972 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-19 19:09:40,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:40,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021074055] [2020-10-19 19:09:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:40,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:41,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:41,012 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 19:09:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-19 19:09:41,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 19:09:41,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775490339] [2020-10-19 19:09:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 19:09:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:41,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 19:09:41,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 19:09:41,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 19:09:41,205 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-19 19:09:41,580 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-19 19:09:41,634 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,770 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-19 19:09:41,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 19:09:41,776 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 19:09:41,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-19 19:09:41,907 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-19 19:09:41,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 07:09:41 BoogieIcfgContainer [2020-10-19 19:09:41,961 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 19:09:41,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 19:09:41,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 19:09:41,962 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 19:09:41,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 07:09:39" (3/4) ... [2020-10-19 19:09:41,966 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-19 19:09:42,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-19 19:09:42,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 19:09:42,042 INFO L168 Benchmark]: Toolchain (without parser) took 4087.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.0 MB in the beginning and 842.5 MB in the end (delta: 117.4 MB). Peak memory consumption was 249.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,045 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:09:42,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,052 INFO L168 Benchmark]: Boogie Preprocessor took 42.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,053 INFO L168 Benchmark]: RCFGBuilder took 740.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,055 INFO L168 Benchmark]: BuchiAutomizer took 2580.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 224.6 MB). Peak memory consumption was 224.6 MB. Max. memory is 11.5 GB. [2020-10-19 19:09:42,057 INFO L168 Benchmark]: Witness Printer took 78.11 ms. Allocated memory is still 1.2 GB. Free memory is still 842.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 19:09:42,067 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 575.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 740.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2580.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.5 MB in the end (delta: 224.6 MB). Peak memory consumption was 224.6 MB. Max. memory is 11.5 GB. * Witness Printer took 78.11 ms. Allocated memory is still 1.2 GB. Free memory is still 842.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 48 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 167 SDtfs, 71 SDslu, 179 SDs, 0 SdLazy, 191 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=4380} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e4603f8=0, NULL=0, NULL=4382, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cbf9d34=0, NULL=4380, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c14ccb8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51a48fe2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@be9971d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@378e7772=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43847aeb=0, root=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13890b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d3db06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e4603f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@51a48fe2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fca9a4a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cbf9d34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3525542b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c15fd58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66a1ef60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a3e5ebe=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ae1ba76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1d3db06=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c7c0545=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c4d9140=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75861736=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c4d9140=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@378e7772=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@13890b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c14ccb8=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bd71c9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@608c336f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e48fac=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b980d2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7153430b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1de68586=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75861736=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b33e46=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32b0fdb8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@be9971d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b6fa25f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9384471=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@23e48fac=0, n=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9384471=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43ee7e6=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39ce961b=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32b97be1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dab02b8=27, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3638d78d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@608c336f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3525542b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43847aeb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1de68586=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@32b0fdb8=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@66a1ef60=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@52a142a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ce1dde8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3b6fa25f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@bd71c9e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@69e282b9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c7c0545=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3638d78d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51edf936=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b33e46=0, pred=0, NULL=4381, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c15fd58=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51edf936=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b980d2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 555]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) Loop: [L555] COND TRUE __VERIFIER_nondet_int() [L556] n = root [L557] EXPR n->left [L557] n->left && n->right [L557] COND FALSE !(n->left && n->right) [L563] EXPR n->left [L563] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L568] EXPR n->right [L568] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...