./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer --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.0-a4ecdab [2020-11-28 03:18:15,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:18:15,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:18:15,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:18:15,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:18:15,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:18:15,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:18:15,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:18:15,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:18:15,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:18:15,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:18:15,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:18:15,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:18:15,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:18:15,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:18:15,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:18:15,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:18:15,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:18:15,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:18:15,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:18:15,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:18:15,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:18:15,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:18:15,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:18:16,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:18:16,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:18:16,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:18:16,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:18:16,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:18:16,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:18:16,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:18:16,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:18:16,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:18:16,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:18:16,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:18:16,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:18:16,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:18:16,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:18:16,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:18:16,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:18:16,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:18:16,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:18:16,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:18:16,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:18:16,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:18:16,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:18:16,061 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:18:16,062 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:18:16,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:18:16,062 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:18:16,062 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:18:16,062 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:18:16,064 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:18:16,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:18:16,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:18:16,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:18:16,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:18:16,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:18:16,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:18:16,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:18:16,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:18:16,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:18:16,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:18:16,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:18:16,066 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:18:16,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:18:16,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:18:16,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:18:16,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:18:16,068 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:18:16,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:18:16,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:18:16,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:18:16,069 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:18:16,070 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:18:16,070 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:/tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer 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 [2020-11-28 03:18:16,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:18:16,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:18:16,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:18:16,349 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:18:16,350 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:18:16,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-11-28 03:18:16,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/data/d7c2f04c8/2b2d96ae2869427f8b26a0f2e752a2fa/FLAGc2952d744 [2020-11-28 03:18:17,029 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:18:17,030 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/sv-benchmarks/c/memsafety-ext/tree_stack.i [2020-11-28 03:18:17,050 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/data/d7c2f04c8/2b2d96ae2869427f8b26a0f2e752a2fa/FLAGc2952d744 [2020-11-28 03:18:17,260 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/data/d7c2f04c8/2b2d96ae2869427f8b26a0f2e752a2fa [2020-11-28 03:18:17,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:18:17,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:18:17,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:17,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:18:17,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:18:17,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377003ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17, skipping insertion in model container [2020-11-28 03:18:17,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:18:17,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:18:17,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:17,699 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:18:17,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:18:17,825 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:18:17,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17 WrapperNode [2020-11-28 03:18:17,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:18:17,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:17,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:18:17,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:18:17,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:18:17,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:18:17,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:18:17,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:18:17,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... [2020-11-28 03:18:17,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:18:17,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:18:17,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:18:17,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:18:17,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:18:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-28 03:18:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-28 03:18:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:18:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-28 03:18:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:18:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:18:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:18:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:18:18,615 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:18:18,616 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-28 03:18:18,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:18 BoogieIcfgContainer [2020-11-28 03:18:18,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:18:18,618 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:18:18,619 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:18:18,622 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:18:18,623 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:18,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:18:17" (1/3) ... [2020-11-28 03:18:18,624 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5af6819a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:18, skipping insertion in model container [2020-11-28 03:18:18,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:18,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:18:17" (2/3) ... [2020-11-28 03:18:18,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5af6819a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:18:18, skipping insertion in model container [2020-11-28 03:18:18,625 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:18:18,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:18" (3/3) ... [2020-11-28 03:18:18,626 INFO L373 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2020-11-28 03:18:18,670 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:18:18,670 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:18:18,671 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:18:18,671 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:18:18,671 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:18:18,671 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:18:18,671 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:18:18,672 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:18:18,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-28 03:18:18,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-11-28 03:18:18,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:18,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:18,705 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:18,705 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:18:18,706 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:18:18,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-11-28 03:18:18,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-11-28 03:18:18,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:18,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:18,708 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:18,708 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:18:18,715 INFO L794 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 [2020-11-28 03:18:18,716 INFO L796 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 [2020-11-28 03:18:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-11-28 03:18:18,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:18,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343227498] [2020-11-28 03:18:18,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:18,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:18,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:18,874 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2020-11-28 03:18:18,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:18,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491053899] [2020-11-28 03:18:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:18,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491053899] [2020-11-28 03:18:18,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:18,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:18:18,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992764468] [2020-11-28 03:18:18,925 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:18,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-28 03:18:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-28 03:18:18,945 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-11-28 03:18:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:18,952 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-11-28 03:18:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-28 03:18:18,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2020-11-28 03:18:18,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-11-28 03:18:18,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2020-11-28 03:18:18,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-11-28 03:18:18,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-11-28 03:18:18,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-11-28 03:18:18,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:18,964 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-11-28 03:18:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-11-28 03:18:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-11-28 03:18:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-28 03:18:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-11-28 03:18:18,985 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-11-28 03:18:18,985 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-11-28 03:18:18,985 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:18:18,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2020-11-28 03:18:18,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-11-28 03:18:18,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:18,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:18,987 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:18,987 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:18,987 INFO L794 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 [2020-11-28 03:18:18,988 INFO L796 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~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.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 [2020-11-28 03:18:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:18,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-11-28 03:18:18,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:18,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935546641] [2020-11-28 03:18:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,031 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2020-11-28 03:18:19,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:19,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377741064] [2020-11-28 03:18:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:19,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377741064] [2020-11-28 03:18:19,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:19,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:19,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546289067] [2020-11-28 03:18:19,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:18:19,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:18:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:18:19,211 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-11-28 03:18:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:19,436 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2020-11-28 03:18:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:18:19,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2020-11-28 03:18:19,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-11-28 03:18:19,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2020-11-28 03:18:19,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-11-28 03:18:19,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-11-28 03:18:19,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2020-11-28 03:18:19,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:19,442 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-11-28 03:18:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2020-11-28 03:18:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2020-11-28 03:18:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:18:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-11-28 03:18:19,450 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-11-28 03:18:19,450 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-11-28 03:18:19,450 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:18:19,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-11-28 03:18:19,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-11-28 03:18:19,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:19,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:19,455 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:19,455 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:19,455 INFO L794 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 [2020-11-28 03:18:19,455 INFO L796 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~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.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 [2020-11-28 03:18:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-11-28 03:18:19,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:19,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041298771] [2020-11-28 03:18:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,482 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,513 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2020-11-28 03:18:19,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:19,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214656882] [2020-11-28 03:18:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:19,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:19,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2020-11-28 03:18:19,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:19,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490203906] [2020-11-28 03:18:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:18:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:18:19,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490203906] [2020-11-28 03:18:19,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:18:19,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:18:19,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159613803] [2020-11-28 03:18:20,009 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2020-11-28 03:18:20,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:18:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:18:20,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:18:20,067 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-11-28 03:18:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:18:20,313 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2020-11-28 03:18:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:18:20,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2020-11-28 03:18:20,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-11-28 03:18:20,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2020-11-28 03:18:20,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-11-28 03:18:20,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-11-28 03:18:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2020-11-28 03:18:20,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:18:20,318 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-11-28 03:18:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2020-11-28 03:18:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-11-28 03:18:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-11-28 03:18:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-11-28 03:18:20,321 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-11-28 03:18:20,321 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-11-28 03:18:20,321 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:18:20,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2020-11-28 03:18:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2020-11-28 03:18:20,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:18:20,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:18:20,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-11-28 03:18:20,325 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:18:20,326 INFO L794 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 [2020-11-28 03:18:20,326 INFO L796 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~mem8.base, main_#t~mem8.offset;havoc main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.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 [2020-11-28 03:18:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:20,327 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-11-28 03:18:20,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:20,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14500453] [2020-11-28 03:18:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,384 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2020-11-28 03:18:20,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:20,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408199516] [2020-11-28 03:18:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:18:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2020-11-28 03:18:20,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:18:20,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728598293] [2020-11-28 03:18:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:18:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:18:20,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:18:20,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:18:20,636 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-11-28 03:18:21,066 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2020-11-28 03:18:21,114 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 03:18:21,278 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-28 03:18:21,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-28 03:18:21,280 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-28 03:18:21,280 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:187, output treesize:175 [2020-11-28 03:18:21,400 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-28 03:18:21,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:18:21 BoogieIcfgContainer [2020-11-28 03:18:21,443 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:18:21,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:18:21,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:18:21,453 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:18:21,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:18:18" (3/4) ... [2020-11-28 03:18:21,463 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:18:21,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7cacbcae-a22c-4dea-99b0-8c55b3c3e58c/bin/uautomizer/witness.graphml [2020-11-28 03:18:21,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:18:21,513 INFO L168 Benchmark]: Toolchain (without parser) took 4247.22 ms. Allocated memory was 107.0 MB in the beginning and 144.7 MB in the end (delta: 37.7 MB). Free memory was 81.7 MB in the beginning and 104.2 MB in the end (delta: -22.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,513 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 107.0 MB. Free memory is still 63.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:18:21,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.23 ms. Allocated memory is still 107.0 MB. Free memory was 81.7 MB in the beginning and 71.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 107.0 MB. Free memory was 71.4 MB in the beginning and 69.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,529 INFO L168 Benchmark]: Boogie Preprocessor took 59.06 ms. Allocated memory is still 107.0 MB. Free memory was 69.3 MB in the beginning and 67.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,530 INFO L168 Benchmark]: RCFGBuilder took 647.26 ms. Allocated memory was 107.0 MB in the beginning and 144.7 MB in the end (delta: 37.7 MB). Free memory was 67.5 MB in the beginning and 117.3 MB in the end (delta: -49.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,532 INFO L168 Benchmark]: BuchiAutomizer took 2825.46 ms. Allocated memory is still 144.7 MB. Free memory was 117.3 MB in the beginning and 105.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:18:21,532 INFO L168 Benchmark]: Witness Printer took 66.85 ms. Allocated memory is still 144.7 MB. Free memory was 105.1 MB in the beginning and 104.2 MB in the end (delta: 898.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:18:21,536 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.14 ms. Allocated memory is still 107.0 MB. Free memory is still 63.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 561.23 ms. Allocated memory is still 107.0 MB. Free memory was 81.7 MB in the beginning and 71.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.86 ms. Allocated memory is still 107.0 MB. Free memory was 71.4 MB in the beginning and 69.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 59.06 ms. Allocated memory is still 107.0 MB. Free memory was 69.3 MB in the beginning and 67.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 647.26 ms. Allocated memory was 107.0 MB in the beginning and 144.7 MB in the end (delta: 37.7 MB). Free memory was 67.5 MB in the beginning and 117.3 MB in the end (delta: -49.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2825.46 ms. Allocated memory is still 144.7 MB. Free memory was 117.3 MB in the beginning and 105.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. * Witness Printer took 66.85 ms. Allocated memory is still 144.7 MB. Free memory was 105.1 MB in the beginning and 104.2 MB in the end (delta: 898.5 kB). There was no memory consumed. 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 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s 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, 0.2s 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=1464} State at position 1 is {s=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b7a5358=0, NULL=1465, NULL=1464, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@776764c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28f81312=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a29ca9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27a2a2cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43be2207=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d8c2b80=0, root=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e27f5f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a202a3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28f81312=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2798a582=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fa7d70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bdebbdc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a97a649=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3a202a3e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@421b51e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6240f5b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@421b51e8=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@27a2a2cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e27f5f3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4d8c2b80=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@776764c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a6ec112=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f8973f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fc47765=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6240f5b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35597945=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@425d6c76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a2c3380=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a29ca9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28b28386=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33f6fe79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a6ec112=0, n=1463, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@33f6fe79=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34b0219a=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c09bb0d=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7b7a5358=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1fa7d70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@43be2207=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7fc47765=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a2c3380=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@6dcb043f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28b28386=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48111d7b=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@425d6c76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c09bb0d=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@35597945=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48111d7b=0, s=0, NULL=1466, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2f8973f4=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! Received shutdown request...