./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 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.5.800.v20200727-1323.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/memsafety-ext/tree_dsw.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 0046771f7e99737dcb98805b185666cbe0afcb5f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 21:58:55,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 21:58:55,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 21:58:55,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 21:58:55,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 21:58:55,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 21:58:55,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 21:58:55,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 21:58:55,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 21:58:55,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 21:58:55,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 21:58:55,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 21:58:55,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 21:58:55,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 21:58:55,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 21:58:55,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 21:58:55,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 21:58:55,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 21:58:55,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 21:58:55,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 21:58:55,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 21:58:55,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 21:58:55,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 21:58:55,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 21:58:55,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 21:58:55,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 21:58:55,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 21:58:55,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 21:58:55,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 21:58:55,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 21:58:55,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 21:58:55,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 21:58:55,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 21:58:55,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 21:58:55,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 21:58:55,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 21:58:55,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 21:58:55,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 21:58:55,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 21:58:55,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 21:58:55,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 21:58:55,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 21:58:55,525 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 21:58:55,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 21:58:55,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 21:58:55,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 21:58:55,527 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 21:58:55,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 21:58:55,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 21:58:55,528 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 21:58:55,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 21:58:55,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 21:58:55,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 21:58:55,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 21:58:55,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 21:58:55,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 21:58:55,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 21:58:55,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 21:58:55,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 21:58:55,531 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 21:58:55,531 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0046771f7e99737dcb98805b185666cbe0afcb5f [2021-07-06 21:58:55,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 21:58:55,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 21:58:55,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 21:58:55,811 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 21:58:55,812 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 21:58:55,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-07-06 21:58:55,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4295756/abc1b3265d3d4e618d3a94258ea741a0/FLAG966913c85 [2021-07-06 21:58:56,246 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 21:58:56,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2021-07-06 21:58:56,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4295756/abc1b3265d3d4e618d3a94258ea741a0/FLAG966913c85 [2021-07-06 21:58:56,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4295756/abc1b3265d3d4e618d3a94258ea741a0 [2021-07-06 21:58:56,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 21:58:56,596 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 21:58:56,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 21:58:56,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 21:58:56,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 21:58:56,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ec391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56, skipping insertion in model container [2021-07-06 21:58:56,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 21:58:56,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 21:58:56,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 21:58:56,864 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 21:58:56,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 21:58:56,925 INFO L208 MainTranslator]: Completed translation [2021-07-06 21:58:56,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56 WrapperNode [2021-07-06 21:58:56,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 21:58:56,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 21:58:56,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 21:58:56,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 21:58:56,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 21:58:56,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 21:58:56,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 21:58:56,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 21:58:56,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:56,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:57,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:57,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:57,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:57,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 21:58:57,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 21:58:57,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 21:58:57,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 21:58:57,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (1/1) ... [2021-07-06 21:58:57,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 21:58:57,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 21:58:57,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-07-06 21:58:57,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-07-06 21:58:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-07-06 21:58:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-07-06 21:58:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 21:58:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-07-06 21:58:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-06 21:58:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 21:58:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 21:58:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 21:58:57,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 21:58:57,499 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-07-06 21:58:57,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:58:57 BoogieIcfgContainer [2021-07-06 21:58:57,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 21:58:57,500 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 21:58:57,501 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 21:58:57,502 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 21:58:57,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:58:57,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 09:58:56" (1/3) ... [2021-07-06 21:58:57,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e61ae25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 09:58:57, skipping insertion in model container [2021-07-06 21:58:57,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:58:57,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:58:56" (2/3) ... [2021-07-06 21:58:57,504 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e61ae25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 09:58:57, skipping insertion in model container [2021-07-06 21:58:57,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:58:57,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:58:57" (3/3) ... [2021-07-06 21:58:57,505 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2021-07-06 21:58:57,539 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 21:58:57,540 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 21:58:57,540 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 21:58:57,540 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 21:58:57,540 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 21:58:57,540 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 21:58:57,540 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 21:58:57,540 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 21:58:57,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,559 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-07-06 21:58:57,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:58:57,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:58:57,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:58:57,562 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 21:58:57,562 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 21:58:57,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-07-06 21:58:57,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:58:57,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:58:57,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:58:57,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 21:58:57,568 INFO L791 eck$LassoCheckResult]: Stem: 25#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(11); 8#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 18#L549-2true [2021-07-06 21:58:57,569 INFO L793 eck$LassoCheckResult]: Loop: 18#L549-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; 3#L539-2true assume !true; 22#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L544true 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; 24#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L549true 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; 18#L549-2true [2021-07-06 21:58:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 21:58:57,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:57,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096502946] [2021-07-06 21:58:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:57,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:57,635 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:57,647 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:57,659 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-07-06 21:58:57,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:57,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209447413] [2021-07-06 21:58:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:57,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:58:57,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:57,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 21:58:57,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:58:57,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209447413] [2021-07-06 21:58:57,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209447413] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:58:57,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:58:57,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 21:58:57,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685832129] [2021-07-06 21:58:57,688 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 21:58:57,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:58:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-06 21:58:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-06 21:58:57,697 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:58:57,701 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2021-07-06 21:58:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-06 21:58:57,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2021-07-06 21:58:57,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-07-06 21:58:57,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2021-07-06 21:58:57,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-07-06 21:58:57,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-07-06 21:58:57,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2021-07-06 21:58:57,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:58:57,707 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-07-06 21:58:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2021-07-06 21:58:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-07-06 21:58:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2021-07-06 21:58:57,721 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-07-06 21:58:57,721 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2021-07-06 21:58:57,721 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 21:58:57,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2021-07-06 21:58:57,722 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2021-07-06 21:58:57,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:58:57,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:58:57,722 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:58:57,722 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:58:57,722 INFO L791 eck$LassoCheckResult]: Stem: 78#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(11); 75#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 63#L549-2 [2021-07-06 21:58:57,723 INFO L793 eck$LassoCheckResult]: Loop: 63#L549-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; 58#L539-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; 59#L538-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; 60#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset; 68#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L544 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; 73#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 77#L549 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; 63#L549-2 [2021-07-06 21:58:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:57,723 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 21:58:57,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:57,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612216465] [2021-07-06 21:58:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:57,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:57,741 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:57,759 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:57,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-07-06 21:58:57,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:57,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639388206] [2021-07-06 21:58:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:57,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:58:57,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:57,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 21:58:57,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-06 21:58:57,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-06 21:58:57,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:57,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 21:58:57,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:58:57,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639388206] [2021-07-06 21:58:57,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639388206] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:58:57,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:58:57,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 21:58:57,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133888004] [2021-07-06 21:58:57,874 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 21:58:57,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:58:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 21:58:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-06 21:58:57,875 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:58:57,960 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2021-07-06 21:58:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 21:58:57,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2021-07-06 21:58:57,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2021-07-06 21:58:57,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2021-07-06 21:58:57,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-07-06 21:58:57,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-07-06 21:58:57,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2021-07-06 21:58:57,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:58:57,972 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2021-07-06 21:58:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2021-07-06 21:58:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-07-06 21:58:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2021-07-06 21:58:57,975 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-07-06 21:58:57,975 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2021-07-06 21:58:57,975 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 21:58:57,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2021-07-06 21:58:57,978 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2021-07-06 21:58:57,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:58:57,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:58:57,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:58:57,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:58:57,980 INFO L791 eck$LassoCheckResult]: Stem: 138#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(11); 135#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 123#L549-2 [2021-07-06 21:58:57,980 INFO L793 eck$LassoCheckResult]: Loop: 123#L549-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; 117#L539-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; 118#L538-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; 119#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset; 128#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L544 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; 133#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 137#L549 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; 123#L549-2 [2021-07-06 21:58:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 21:58:57,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:57,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115462673] [2021-07-06 21:58:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:57,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,002 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,012 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,018 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-07-06 21:58:58,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:58,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522603894] [2021-07-06 21:58:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:58,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,030 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,037 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,040 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-07-06 21:58:58,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:58,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099881423] [2021-07-06 21:58:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:58,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:58:58,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:58,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 21:58:58,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 21:58:58,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-06 21:58:58,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:58:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 21:58:58,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:58:58,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099881423] [2021-07-06 21:58:58,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099881423] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:58:58,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:58:58,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 21:58:58,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669387722] [2021-07-06 21:58:58,229 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-07-06 21:58:58,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-06 21:58:58,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:58:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 21:58:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 21:58:58,276 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:58:58,428 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-07-06 21:58:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-06 21:58:58,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2021-07-06 21:58:58,430 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-07-06 21:58:58,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2021-07-06 21:58:58,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-07-06 21:58:58,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-07-06 21:58:58,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2021-07-06 21:58:58,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:58:58,432 INFO L681 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2021-07-06 21:58:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2021-07-06 21:58:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-07-06 21:58:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 21:58:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-07-06 21:58:58,436 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-07-06 21:58:58,436 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-07-06 21:58:58,436 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 21:58:58,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2021-07-06 21:58:58,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2021-07-06 21:58:58,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:58:58,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:58:58,438 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:58:58,439 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:58:58,440 INFO L791 eck$LassoCheckResult]: Stem: 218#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(11); 214#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~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~malloc25.base, main_#t~malloc25.offset, 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~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_#t~malloc32.base, main_#t~malloc32.offset, main_#t~mem33.base, main_#t~mem33.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~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); 215#L549-2 [2021-07-06 21:58:58,441 INFO L793 eck$LassoCheckResult]: Loop: 215#L549-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; 195#L539-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; 196#L538-1 assume !main_#t~short9; 197#L538-3 assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem7.base, main_#t~mem7.offset; 226#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L544 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; 223#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L549 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; 215#L549-2 [2021-07-06 21:58:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 21:58:58,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:58,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758972917] [2021-07-06 21:58:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:58,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,455 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,459 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,461 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-07-06 21:58:58,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:58,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403344451] [2021-07-06 21:58:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:58,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,471 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,479 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,483 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:58:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-07-06 21:58:58,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:58:58,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84747043] [2021-07-06 21:58:58,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:58:58,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:58:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,502 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:58:58,519 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:58:58,522 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:58:58,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 21:58:58,870 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-07-06 21:58:58,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:58:58,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-06 21:58:58,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 189 [2021-07-06 21:58:58,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:58:58,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:58:58,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:58:58,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 21:58:58,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:58:58,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:58,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:58:58,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 21:58:58,926 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-06 21:58:58,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:59,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:59,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:58:59,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:59,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:58:59,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 21:58:59,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-06 21:58:59,004 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2021-07-06 21:58:59,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:59,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:58:59,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:58:59,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:58:59,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 21:58:59,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 09:58:59 BoogieIcfgContainer [2021-07-06 21:58:59,119 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 21:58:59,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 21:58:59,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 21:58:59,119 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 21:58:59,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:58:57" (3/4) ... [2021-07-06 21:58:59,121 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 21:58:59,138 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 21:58:59,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 21:58:59,139 INFO L168 Benchmark]: Toolchain (without parser) took 2543.07 ms. Allocated memory was 62.9 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Free memory was 42.8 MB in the beginning and 70.1 MB in the end (delta: -27.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,139 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 62.9 MB. Free memory is still 45.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 21:58:59,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.97 ms. Allocated memory is still 62.9 MB. Free memory was 42.6 MB in the beginning and 34.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.66 ms. Allocated memory is still 62.9 MB. Free memory was 34.4 MB in the beginning and 32.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,140 INFO L168 Benchmark]: Boogie Preprocessor took 46.06 ms. Allocated memory is still 62.9 MB. Free memory was 32.3 MB in the beginning and 30.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,140 INFO L168 Benchmark]: RCFGBuilder took 479.40 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 30.4 MB in the beginning and 65.5 MB in the end (delta: -35.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,140 INFO L168 Benchmark]: BuchiAutomizer took 1618.43 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 65.5 MB in the beginning and 71.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,141 INFO L168 Benchmark]: Witness Printer took 18.91 ms. Allocated memory is still 107.0 MB. Free memory was 71.2 MB in the beginning and 70.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 21:58:59,142 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.10 ms. Allocated memory is still 62.9 MB. Free memory is still 45.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 328.97 ms. Allocated memory is still 62.9 MB. Free memory was 42.6 MB in the beginning and 34.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.66 ms. Allocated memory is still 62.9 MB. Free memory was 34.4 MB in the beginning and 32.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.06 ms. Allocated memory is still 62.9 MB. Free memory was 32.3 MB in the beginning and 30.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 479.40 ms. Allocated memory was 62.9 MB in the beginning and 88.1 MB in the end (delta: 25.2 MB). Free memory was 30.4 MB in the beginning and 65.5 MB in the end (delta: -35.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1618.43 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 65.5 MB in the beginning and 71.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 47.5 MB. Max. memory is 16.1 GB. * Witness Printer took 18.91 ms. Allocated memory is still 107.0 MB. Free memory was 71.2 MB in the beginning and 70.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 13.6ms AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 154.7ms 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: 536]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1315} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16979fea=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bff9cb6=0, NULL=1316, NULL=1315, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4b7e96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9f2c893=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a8ec041=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46313942=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@465ff957=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22051238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@16979fea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1176bc8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3abcce8e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@101d6af3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e21ab2e=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16700229=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@22051238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@641c90e3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1370d9e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b2118da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1370d9e1=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7a8ec041=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@465ff957=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d1fbe0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c4b7e96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e3a839f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5574ec5=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31fd04ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35957806=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b2118da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@471d9e2f=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ba12e73=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5d1fbe0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@9f2c893=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42023bb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e887bd1=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5574ec5=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e887bd1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5378407b=23, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2e3a839f=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bff9cb6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3abcce8e=0, sentinel=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46313942=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@345830e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35957806=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3ba12e73=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7ce6dc1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@42023bb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@345830e4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@641c90e3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e21ab2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64b77ea=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@471d9e2f=0, pred=0, s=0, NULL=1317, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64b77ea=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@31fd04ea=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 536]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L533] struct TreeNode* root = malloc(sizeof(*root)), *n; [L534] root->left = ((void *)0) [L535] root->right = ((void *)0) Loop: [L536] COND TRUE __VERIFIER_nondet_int() [L537] n = root [L538] EXPR n->left [L538] n->left && n->right [L538] COND FALSE !(n->left && n->right) [L544] EXPR n->left [L544] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L549] EXPR n->right [L549] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 21:58:59,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...