./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-9a8b2e8 [2020-10-20 07:02:47,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:02:47,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:02:47,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:02:47,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:02:47,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:02:47,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:02:47,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:02:47,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:02:47,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:02:47,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:02:47,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:02:47,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:02:47,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:02:47,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:02:47,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:02:47,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:02:47,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:02:47,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:02:47,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:02:47,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:02:47,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:02:47,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:02:47,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:02:47,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:02:47,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:02:47,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:02:47,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:02:47,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:02:47,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:02:47,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:02:47,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:02:47,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:02:47,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:02:47,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:02:47,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:02:47,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:02:47,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:02:47,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:02:47,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:02:47,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:02:47,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:02:47,359 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:02:47,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:02:47,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:02:47,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:02:47,361 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:02:47,361 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:02:47,361 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:02:47,361 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:02:47,361 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:02:47,362 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:02:47,362 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:02:47,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:02:47,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:02:47,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:02:47,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:02:47,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:02:47,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:02:47,364 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:02:47,364 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:02:47,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:02:47,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:02:47,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:02:47,365 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:02:47,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:02:47,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:02:47,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:02:47,366 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:02:47,367 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:02:47,367 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-20 07:02:47,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:02:47,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:02:47,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:02:47,592 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:02:47,593 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:02:47,594 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-20 07:02:47,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fae58697/4a2d8fa3c9a1446eb1f65c2c065fb332/FLAG9f31afd70 [2020-10-20 07:02:48,301 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:02:48,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-1.i [2020-10-20 07:02:48,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fae58697/4a2d8fa3c9a1446eb1f65c2c065fb332/FLAG9f31afd70 [2020-10-20 07:02:48,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fae58697/4a2d8fa3c9a1446eb1f65c2c065fb332 [2020-10-20 07:02:48,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:02:48,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:02:48,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:48,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:02:48,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:02:48,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6068a7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:48, skipping insertion in model container [2020-10-20 07:02:48,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:02:48" (1/1) ... [2020-10-20 07:02:48,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:02:48,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:02:49,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:49,043 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:02:49,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:02:49,189 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:02:49,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49 WrapperNode [2020-10-20 07:02:49,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:02:49,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:02:49,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:02:49,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:02:49,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:02:49,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:02:49,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (1/1) ... [2020-10-20 07:02:49,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:02:49,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:02:49,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:02:49,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:02:49,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (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-20 07:02:49,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:02:49,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:02:49,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 07:02:49,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 07:02:49,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:02:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 07:02:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:02:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:02:49,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:02:49,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:02:50,048 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:02:50,060 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-20 07:02:50,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50 BoogieIcfgContainer [2020-10-20 07:02:50,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:02:50,065 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:02:50,065 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:02:50,069 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:02:50,070 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:02:48" (1/3) ... [2020-10-20 07:02:50,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5593f66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:50, skipping insertion in model container [2020-10-20 07:02:50,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:02:49" (2/3) ... [2020-10-20 07:02:50,073 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5593f66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:02:50, skipping insertion in model container [2020-10-20 07:02:50,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:02:50,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50" (3/3) ... [2020-10-20 07:02:50,075 INFO L373 chiAutomizerObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-10-20 07:02:50,121 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:02:50,122 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:02:50,122 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:02:50,122 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:02:50,122 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:02:50,122 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:02:50,123 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:02:50,123 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:02:50,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 07:02:50,163 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,171 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,171 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,172 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:02:50,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-10-20 07:02:50,176 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,177 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,177 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,184 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-20 07:02:50,185 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;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~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 8#L568-2true [2020-10-20 07:02:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:02:50,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001687279] [2020-10-20 07:02:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,372 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-10-20 07:02:50,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833889930] [2020-10-20 07:02:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,442 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-20 07:02:50,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833889930] [2020-10-20 07:02:50,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:50,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:02:50,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624652074] [2020-10-20 07:02:50,449 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:02:50,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:50,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 07:02:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 07:02:50,465 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2020-10-20 07:02:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:50,475 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2020-10-20 07:02:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 07:02:50,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2020-10-20 07:02:50,479 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2020-10-20 07:02:50,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 07:02:50,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-20 07:02:50,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:50,488 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-20 07:02:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 07:02:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-20 07:02:50,524 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,524 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-20 07:02:50,524 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:02:50,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2020-10-20 07:02:50,526 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 30 [2020-10-20 07:02:50,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,526 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,526 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,527 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-20 07:02:50,527 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;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~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 102#L568-2 [2020-10-20 07:02:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-10-20 07:02:50,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353067060] [2020-10-20 07:02:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-10-20 07:02:50,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480033648] [2020-10-20 07:02:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:50,796 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-20 07:02:50,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480033648] [2020-10-20 07:02:50,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:50,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:50,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450161112] [2020-10-20 07:02:50,798 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:02:50,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:50,799 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 27 Second operand 5 states. [2020-10-20 07:02:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:50,954 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2020-10-20 07:02:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:02:50,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,957 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2020-10-20 07:02:50,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 65 transitions. [2020-10-20 07:02:50,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-10-20 07:02:50,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-10-20 07:02:50,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:50,961 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 65 transitions. [2020-10-20 07:02:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 65 transitions. [2020-10-20 07:02:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-20 07:02:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 07:02:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-20 07:02:50,966 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-20 07:02:50,966 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-20 07:02:50,967 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:02:50,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2020-10-20 07:02:50,968 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 33 [2020-10-20 07:02:50,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:50,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:50,968 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:50,969 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:50,969 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-20 07:02:50,969 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 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~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 193#L568-2 [2020-10-20 07:02:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-10-20 07:02:50,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:50,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114068724] [2020-10-20 07:02:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:50,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,029 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-10-20 07:02:51,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607010814] [2020-10-20 07:02:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-10-20 07:02:51,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630766770] [2020-10-20 07:02:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:02:51,150 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-20 07:02:51,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630766770] [2020-10-20 07:02:51,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:02:51,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:02:51,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804781828] [2020-10-20 07:02:51,325 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-10-20 07:02:51,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:02:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:02:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:02:51,377 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 28 Second operand 5 states. [2020-10-20 07:02:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:02:51,719 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2020-10-20 07:02:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:02:51,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,722 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 60 [2020-10-20 07:02:51,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 137 transitions. [2020-10-20 07:02:51,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-10-20 07:02:51,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-10-20 07:02:51,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:02:51,726 INFO L691 BuchiCegarLoop]: Abstraction has 92 states and 137 transitions. [2020-10-20 07:02:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 137 transitions. [2020-10-20 07:02:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2020-10-20 07:02:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 07:02:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2020-10-20 07:02:51,745 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-20 07:02:51,745 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 69 transitions. [2020-10-20 07:02:51,745 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:02:51,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 69 transitions. [2020-10-20 07:02:51,746 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 41 [2020-10-20 07:02:51,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:02:51,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:02:51,747 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:02:51,747 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:02:51,748 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-20 07:02:51,748 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~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 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~nondet19;havoc main_#t~mem18.base, main_#t~mem18.offset; 339#L568-2 [2020-10-20 07:02:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-10-20 07:02:51,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805983077] [2020-10-20 07:02:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,778 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-10-20 07:02:51,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718492023] [2020-10-20 07:02:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,814 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:02:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-10-20 07:02:51,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:02:51,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262493537] [2020-10-20 07:02:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:02:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,848 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:02:51,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:02:51,882 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:02:52,007 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-10-20 07:02:52,408 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-10-20 07:02:52,456 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-20 07:02:52,584 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 07:02:52,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:02:52,612 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-20 07:02:52,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-10-20 07:02:52,752 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-20 07:02:52,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:02:52 BoogieIcfgContainer [2020-10-20 07:02:52,854 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:02:52,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:02:52,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:02:52,857 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:02:52,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:02:50" (3/4) ... [2020-10-20 07:02:52,869 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 07:02:52,991 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 07:02:52,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:02:52,994 INFO L168 Benchmark]: Toolchain (without parser) took 4392.32 ms. Allocated memory was 40.9 MB in the beginning and 65.5 MB in the end (delta: 24.6 MB). Free memory was 17.6 MB in the beginning and 26.9 MB in the end (delta: -9.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,997 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.3 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. [2020-10-20 07:02:52,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.26 ms. Allocated memory was 40.9 MB in the beginning and 43.5 MB in the end (delta: 2.6 MB). Free memory was 16.8 MB in the beginning and 17.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 8.3 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 43.5 MB. Free memory was 17.9 MB in the beginning and 15.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,004 INFO L168 Benchmark]: Boogie Preprocessor took 54.68 ms. Allocated memory is still 43.5 MB. Free memory was 15.4 MB in the beginning and 12.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,005 INFO L168 Benchmark]: RCFGBuilder took 753.60 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 12.9 MB in the beginning and 28.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,006 INFO L168 Benchmark]: BuchiAutomizer took 2789.17 ms. Allocated memory was 46.7 MB in the beginning and 65.5 MB in the end (delta: 18.9 MB). Free memory was 28.3 MB in the beginning and 28.9 MB in the end (delta: -557.5 kB). Peak memory consumption was 31.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,010 INFO L168 Benchmark]: Witness Printer took 137.01 ms. Allocated memory is still 65.5 MB. Free memory was 28.9 MB in the beginning and 26.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:02:53,017 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.20 ms. Allocated memory is still 31.5 MB. Free memory was 7.4 MB in the beginning and 7.3 MB in the end (delta: 44.0 kB). Peak memory consumption was 44.0 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 583.26 ms. Allocated memory was 40.9 MB in the beginning and 43.5 MB in the end (delta: 2.6 MB). Free memory was 16.8 MB in the beginning and 17.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 8.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 62.88 ms. Allocated memory is still 43.5 MB. Free memory was 17.9 MB in the beginning and 15.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 54.68 ms. Allocated memory is still 43.5 MB. Free memory was 15.4 MB in the beginning and 12.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 753.60 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 12.9 MB in the beginning and 28.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 2789.17 ms. Allocated memory was 46.7 MB in the beginning and 65.5 MB in the end (delta: 18.9 MB). Free memory was 28.3 MB in the beginning and 28.9 MB in the end (delta: -557.5 kB). Peak memory consumption was 31.8 MB. Max. memory is 14.3 GB. * Witness Printer took 137.01 ms. Allocated memory is still 65.5 MB. Free memory was 28.9 MB in the beginning and 26.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 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.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. 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@1b027384=0, NULL=0, NULL=4382, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@972fef7=0, NULL=4380, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4aa8d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31ae27f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5922507c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4188e8f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d6c1813=0, root=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f534e8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24960=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b027384=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31ae27f8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71867233=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@972fef7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37595a84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b0def02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a60b1f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13c76f95=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19b7127a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24960=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6cee9637=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a722fc0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15ae14d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a722fc0=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4188e8f6=0, a=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1f534e8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4aa8d=0, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ce19d59=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ed01e86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@323b9e7b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35218c6d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75fcd6c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@665f8c2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15ae14d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47431c24=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ca2afd3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5922507c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47e7b2d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2139db03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@323b9e7b=0, n=4379, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2139db03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@fc80ab6=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ca76ec0=0, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a9b1667=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67e4012f=27, p=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25b1f00a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ed01e86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37595a84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d6c1813=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@665f8c2f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6ca2afd3=0, t=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a60b1f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3229b9f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@419663c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47e7b2d7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1ce19d59=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@79d5e54b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6cee9637=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25b1f00a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b41204=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@47431c24=0, pred=0, NULL=4381, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b0def02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b41204=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35218c6d=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...