./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.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_stack.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 a0142cb115f7d1e16772bca3adcba9f1aba5ac12 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:59:03,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 21:59:03,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 21:59:03,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 21:59:03,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 21:59:03,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 21:59:03,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 21:59:03,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 21:59:03,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 21:59:03,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 21:59:03,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 21:59:03,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 21:59:03,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 21:59:03,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 21:59:03,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 21:59:03,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 21:59:03,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 21:59:03,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 21:59:03,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 21:59:03,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 21:59:03,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 21:59:03,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 21:59:03,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 21:59:03,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 21:59:03,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 21:59:03,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 21:59:03,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 21:59:03,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 21:59:03,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 21:59:03,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 21:59:03,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 21:59:03,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 21:59:03,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 21:59:03,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 21:59:03,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 21:59:03,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 21:59:03,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 21:59:03,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 21:59:03,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 21:59:03,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 21:59:03,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 21:59:03,798 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:59:03,825 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 21:59:03,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 21:59:03,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 21:59:03,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 21:59:03,828 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 21:59:03,828 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 21:59:03,828 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 21:59:03,828 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 21:59:03,828 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 21:59:03,829 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 21:59:03,829 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 21:59:03,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 21:59:03,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 21:59:03,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 21:59:03,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 21:59:03,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 21:59:03,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 21:59:03,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 21:59:03,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 21:59:03,833 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 21:59:03,833 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 -> a0142cb115f7d1e16772bca3adcba9f1aba5ac12 [2021-07-06 21:59:04,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 21:59:04,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 21:59:04,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 21:59:04,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 21:59:04,103 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 21:59:04,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-07-06 21:59:04,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bea42e57/cea82352b9bf401a97f9deaeddeb3739/FLAG2676a1afc [2021-07-06 21:59:04,604 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 21:59:04,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2021-07-06 21:59:04,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bea42e57/cea82352b9bf401a97f9deaeddeb3739/FLAG2676a1afc [2021-07-06 21:59:04,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bea42e57/cea82352b9bf401a97f9deaeddeb3739 [2021-07-06 21:59:04,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 21:59:04,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 21:59:04,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 21:59:04,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 21:59:04,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 21:59:04,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 09:59:04" (1/1) ... [2021-07-06 21:59:04,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c823b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:04, skipping insertion in model container [2021-07-06 21:59:04,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 09:59:04" (1/1) ... [2021-07-06 21:59:04,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 21:59:04,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 21:59:04,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 21:59:04,961 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 21:59:05,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 21:59:05,049 INFO L208 MainTranslator]: Completed translation [2021-07-06 21:59:05,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05 WrapperNode [2021-07-06 21:59:05,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 21:59:05,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 21:59:05,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 21:59:05,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 21:59:05,056 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:59:05" (1/1) ... [2021-07-06 21:59:05,085 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:59:05" (1/1) ... [2021-07-06 21:59:05,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 21:59:05,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 21:59:05,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 21:59:05,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 21:59:05,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 21:59:05,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 21:59:05,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 21:59:05,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 21:59:05,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (1/1) ... [2021-07-06 21:59:05,158 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 21:59:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 21:59:05,180 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:59:05,197 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:59:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-07-06 21:59:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-07-06 21:59:05,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 21:59:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-07-06 21:59:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-06 21:59:05,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 21:59:05,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 21:59:05,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 21:59:05,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 21:59:05,567 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-07-06 21:59:05,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:59:05 BoogieIcfgContainer [2021-07-06 21:59:05,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 21:59:05,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 21:59:05,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 21:59:05,571 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 21:59:05,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:59:05,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 09:59:04" (1/3) ... [2021-07-06 21:59:05,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cfff585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 09:59:05, skipping insertion in model container [2021-07-06 21:59:05,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:59:05,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 09:59:05" (2/3) ... [2021-07-06 21:59:05,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cfff585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 09:59:05, skipping insertion in model container [2021-07-06 21:59:05,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 21:59:05,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:59:05" (3/3) ... [2021-07-06 21:59:05,573 INFO L389 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2021-07-06 21:59:05,600 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 21:59:05,600 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 21:59:05,600 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 21:59:05,600 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 21:59:05,600 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 21:59:05,600 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 21:59:05,600 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 21:59:05,601 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 21:59:05,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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:59:05,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-07-06 21:59:05,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:59:05,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:59:05,623 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:59:05,624 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 21:59:05,624 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 21:59:05,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) 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:59:05,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-07-06 21:59:05,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:59:05,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:59:05,626 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:59:05,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-07-06 21:59:05,630 INFO L791 eck$LassoCheckResult]: Stem: 17#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(13); 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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 5#L549-2true [2021-07-06 21:59:05,630 INFO L793 eck$LassoCheckResult]: Loop: 5#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; 13#L538-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L544true 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; 16#L544-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#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; 5#L549-2true [2021-07-06 21:59:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-07-06 21:59:05,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:05,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2315198] [2021-07-06 21:59:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:05,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:05,701 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:05,713 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:05,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2021-07-06 21:59:05,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:05,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426165140] [2021-07-06 21:59:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:05,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:59:05,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:05,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:05,762 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:59:05,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:59:05,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426165140] [2021-07-06 21:59:05,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426165140] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:59:05,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:59:05,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-06 21:59:05,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086680163] [2021-07-06 21:59:05,767 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 21:59:05,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:59:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-06 21:59:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-06 21:59:05,777 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.6) 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) 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:59:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:59:05,782 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-07-06 21:59:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-06 21:59:05,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2021-07-06 21:59:05,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-07-06 21:59:05,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2021-07-06 21:59:05,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-07-06 21:59:05,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-07-06 21:59:05,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2021-07-06 21:59:05,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:59:05,789 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-07-06 21:59:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2021-07-06 21:59:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-07-06 21:59:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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:59:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-07-06 21:59:05,805 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-07-06 21:59:05,806 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-07-06 21:59:05,806 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 21:59:05,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2021-07-06 21:59:05,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2021-07-06 21:59:05,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:59:05,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:59:05,808 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:59:05,808 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:59:05,809 INFO L791 eck$LassoCheckResult]: Stem: 65#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(13); 63#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 53#L549-2 [2021-07-06 21:59:05,809 INFO L793 eck$LassoCheckResult]: Loop: 53#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; 50#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; 51#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; 52#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 58#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L544 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; 61#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#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; 53#L549-2 [2021-07-06 21:59:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-07-06 21:59:05,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:05,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160899794] [2021-07-06 21:59:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:05,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:05,846 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:05,858 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:05,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2021-07-06 21:59:05,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:05,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535861698] [2021-07-06 21:59:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:05,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:59:05,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:05,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-06 21:59:05,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-06 21:59:05,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-06 21:59:05,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:05,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:05,975 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:59:05,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:59:05,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535861698] [2021-07-06 21:59:05,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535861698] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:59:05,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:59:05,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 21:59:05,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666799829] [2021-07-06 21:59:05,977 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 21:59:05,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:59:05,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 21:59:05,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-06 21:59:05,978 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 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:59:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:59:06,079 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2021-07-06 21:59:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 21:59:06,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-07-06 21:59:06,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-07-06 21:59:06,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2021-07-06 21:59:06,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-07-06 21:59:06,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-07-06 21:59:06,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2021-07-06 21:59:06,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:59:06,088 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2021-07-06 21:59:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2021-07-06 21:59:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2021-07-06 21:59:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:59:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-07-06 21:59:06,092 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-07-06 21:59:06,092 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-07-06 21:59:06,092 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 21:59:06,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-07-06 21:59:06,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2021-07-06 21:59:06,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:59:06,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:59:06,094 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:59:06,094 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:59:06,094 INFO L791 eck$LassoCheckResult]: Stem: 118#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(13); 115#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 105#L549-2 [2021-07-06 21:59:06,094 INFO L793 eck$LassoCheckResult]: Loop: 105#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; 101#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; 102#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; 103#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 120#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L544 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; 113#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#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; 105#L549-2 [2021-07-06 21:59:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-07-06 21:59:06,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97977315] [2021-07-06 21:59:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,109 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,126 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2021-07-06 21:59:06,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566055528] [2021-07-06 21:59:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,135 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,139 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2021-07-06 21:59:06,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108662277] [2021-07-06 21:59:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 21:59:06,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:06,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 21:59:06,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-06 21:59:06,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-06 21:59:06,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 21:59:06,183 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:59:06,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 21:59:06,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108662277] [2021-07-06 21:59:06,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108662277] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 21:59:06,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 21:59:06,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 21:59:06,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964008840] [2021-07-06 21:59:06,292 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-07-06 21:59:06,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-07-06 21:59:06,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 21:59:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 21:59:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 21:59:06,326 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 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:59:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 21:59:06,440 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2021-07-06 21:59:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-06 21:59:06,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2021-07-06 21:59:06,441 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-07-06 21:59:06,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2021-07-06 21:59:06,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-07-06 21:59:06,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-07-06 21:59:06,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2021-07-06 21:59:06,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 21:59:06,442 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2021-07-06 21:59:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2021-07-06 21:59:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-07-06 21:59:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 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:59:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-07-06 21:59:06,444 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-07-06 21:59:06,444 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-07-06 21:59:06,444 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 21:59:06,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-07-06 21:59:06,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2021-07-06 21:59:06,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 21:59:06,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 21:59:06,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-07-06 21:59:06,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 21:59:06,445 INFO L791 eck$LassoCheckResult]: Stem: 185#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(13); 181#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~malloc23.base, main_#t~malloc23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem29.base, main_#t~mem29.offset, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~mem31.base, main_#t~mem31.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~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); 171#L549-2 [2021-07-06 21:59:06,446 INFO L793 eck$LassoCheckResult]: Loop: 171#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; 168#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; 169#L538-1 assume !main_#t~short9; 170#L538-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~short9;havoc main_#t~mem8.base, main_#t~mem8.offset; 195#L538-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L544 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; 183#L544-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 184#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; 171#L549-2 [2021-07-06 21:59:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-07-06 21:59:06,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929868820] [2021-07-06 21:59:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,453 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,457 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,459 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2021-07-06 21:59:06,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82909862] [2021-07-06 21:59:06,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,463 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,466 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,467 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 21:59:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2021-07-06 21:59:06,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 21:59:06,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845844109] [2021-07-06 21:59:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 21:59:06,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 21:59:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,475 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 21:59:06,482 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 21:59:06,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 21:59:06,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 21:59:06,777 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2021-07-06 21:59:06,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:59:06,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-06 21:59:06,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 189 [2021-07-06 21:59:06,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:59:06,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:59:06,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:59:06,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 21:59:06,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:59:06,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:59:06,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-06 21:59:06,814 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:59:06,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:59:06,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:59:06,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 21:59:06,894 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:59:06,895 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2021-07-06 21:59:06,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-07-06 21:59:06,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 21:59:06,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-06 21:59:06,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 176 [2021-07-06 21:59:07,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 09:59:07 BoogieIcfgContainer [2021-07-06 21:59:07,008 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 21:59:07,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 21:59:07,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 21:59:07,009 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 21:59:07,009 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 09:59:05" (3/4) ... [2021-07-06 21:59:07,011 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 21:59:07,029 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 21:59:07,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 21:59:07,030 INFO L168 Benchmark]: Toolchain (without parser) took 2394.38 ms. Allocated memory was 56.6 MB in the beginning and 132.1 MB in the end (delta: 75.5 MB). Free memory was 34.1 MB in the beginning and 90.1 MB in the end (delta: -56.0 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2021-07-06 21:59:07,030 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 21:59:07,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.25 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.9 MB in the beginning and 42.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-06 21:59:07,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.91 ms. Allocated memory is still 71.3 MB. Free memory was 42.2 MB in the beginning and 40.1 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:59:07,032 INFO L168 Benchmark]: Boogie Preprocessor took 48.85 ms. Allocated memory is still 71.3 MB. Free memory was 40.1 MB in the beginning and 38.2 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:59:07,032 INFO L168 Benchmark]: RCFGBuilder took 415.50 ms. Allocated memory is still 71.3 MB. Free memory was 38.2 MB in the beginning and 45.9 MB in the end (delta: -7.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-07-06 21:59:07,032 INFO L168 Benchmark]: BuchiAutomizer took 1439.85 ms. Allocated memory was 71.3 MB in the beginning and 132.1 MB in the end (delta: 60.8 MB). Free memory was 45.9 MB in the beginning and 92.2 MB in the end (delta: -46.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2021-07-06 21:59:07,033 INFO L168 Benchmark]: Witness Printer took 20.65 ms. Allocated memory is still 132.1 MB. Free memory was 92.2 MB in the beginning and 90.1 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:59:07,035 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.15 ms. Allocated memory is still 56.6 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 412.25 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.9 MB in the beginning and 42.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.91 ms. Allocated memory is still 71.3 MB. Free memory was 42.2 MB in the beginning and 40.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.85 ms. Allocated memory is still 71.3 MB. Free memory was 40.1 MB in the beginning and 38.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 415.50 ms. Allocated memory is still 71.3 MB. Free memory was 38.2 MB in the beginning and 45.9 MB in the end (delta: -7.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 1439.85 ms. Allocated memory was 71.3 MB in the beginning and 132.1 MB in the end (delta: 60.8 MB). Free memory was 45.9 MB in the beginning and 92.2 MB in the end (delta: -46.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. * Witness Printer took 20.65 ms. Allocated memory is still 132.1 MB. Free memory was 92.2 MB in the beginning and 90.1 MB in the end (delta: 2.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 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 139.4ms 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=16844} State at position 1 is {s=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4eb4a4b6=0, NULL=16846, NULL=16844, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32e06acd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e0e0577=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34a59580=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2aaa409=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4422aa2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f72b61f=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48624fd5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e3d7e0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e0e0577=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ab228e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5929038c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60587a96=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6be46315=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7e3d7e0a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@638222b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d0e03b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@638222b4=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2aaa409=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48624fd5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@f72b61f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32e06acd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c6db4d2=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58e1c904=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bc863d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d0e03b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d1b85b8=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@535bb2b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@994abae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@34a59580=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29e02c19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75840525=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c6db4d2=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@75840525=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73403bed=25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@382646e4=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4eb4a4b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5929038c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4422aa2b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4bc863d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@994abae=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@28e3ff29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@29e02c19=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@753e1d8a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@535bb2b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@382646e4=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3d1b85b8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@753e1d8a=0, s=0, NULL=16845, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58e1c904=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:59:07,093 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...