./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/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 9b66bca76c5a21a62f865fe4d9cdb8724001340a .............................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:28:37,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:28:37,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:28:37,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:28:37,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:28:37,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:28:37,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:28:37,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:28:37,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:28:37,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:28:37,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:28:37,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:28:37,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:28:37,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:28:37,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:28:37,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:28:37,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:28:37,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:28:37,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:28:37,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:28:37,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:28:37,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:28:37,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:28:37,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:28:37,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:28:37,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:28:37,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:28:37,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:28:37,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:28:37,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:28:37,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:28:37,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:28:37,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:28:37,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:28:37,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:28:37,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:28:37,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:28:37,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:28:37,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:28:37,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:28:37,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:28:37,974 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 03:28:37,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:28:37,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:28:38,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:28:38,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:28:38,001 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:28:38,001 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 03:28:38,001 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 03:28:38,001 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 03:28:38,001 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 03:28:38,002 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 03:28:38,002 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 03:28:38,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:28:38,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:28:38,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:28:38,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:28:38,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:28:38,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:28:38,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 03:28:38,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 03:28:38,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 03:28:38,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:28:38,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:28:38,004 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 03:28:38,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:28:38,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 03:28:38,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:28:38,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:28:38,005 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 03:28:38,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:28:38,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:28:38,006 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 03:28:38,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 03:28:38,007 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/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 -> 9b66bca76c5a21a62f865fe4d9cdb8724001340a [2019-11-20 03:28:38,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:28:38,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:28:38,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:28:38,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:28:38,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:28:38,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-11-20 03:28:38,247 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/data/d6c62691a/13e5a13fbe4b4e0f93c63a8a2a38800e/FLAG026d626d9 [2019-11-20 03:28:38,721 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:28:38,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2019-11-20 03:28:38,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/data/d6c62691a/13e5a13fbe4b4e0f93c63a8a2a38800e/FLAG026d626d9 [2019-11-20 03:28:39,015 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/data/d6c62691a/13e5a13fbe4b4e0f93c63a8a2a38800e [2019-11-20 03:28:39,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:28:39,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:28:39,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:28:39,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:28:39,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:28:39,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1881a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39, skipping insertion in model container [2019-11-20 03:28:39,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:28:39,064 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:28:39,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:28:39,428 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:28:39,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:28:39,562 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:28:39,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39 WrapperNode [2019-11-20 03:28:39,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:28:39,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:28:39,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:28:39,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:28:39,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:28:39,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:28:39,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:28:39,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:28:39,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... [2019-11-20 03:28:39,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:28:39,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:28:39,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:28:39,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:28:39,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/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 [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:28:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:28:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:28:40,205 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:28:40,205 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 03:28:40,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:40 BoogieIcfgContainer [2019-11-20 03:28:40,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:28:40,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 03:28:40,207 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 03:28:40,210 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 03:28:40,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:28:40,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 03:28:39" (1/3) ... [2019-11-20 03:28:40,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23ae19d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:28:40, skipping insertion in model container [2019-11-20 03:28:40,212 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:28:40,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:39" (2/3) ... [2019-11-20 03:28:40,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23ae19d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:28:40, skipping insertion in model container [2019-11-20 03:28:40,213 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:28:40,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:40" (3/3) ... [2019-11-20 03:28:40,214 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_dsw.i [2019-11-20 03:28:40,254 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 03:28:40,255 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 03:28:40,255 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 03:28:40,255 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:28:40,255 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:28:40,255 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 03:28:40,255 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:28:40,255 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 03:28:40,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-20 03:28:40,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-20 03:28:40,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:28:40,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:28:40,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:28:40,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:28:40,293 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 03:28:40,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-11-20 03:28:40,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-20 03:28:40,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:28:40,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:28:40,296 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:28:40,296 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:28:40,303 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 18#L538-2true [2019-11-20 03:28:40,304 INFO L796 eck$LassoCheckResult]: Loop: 18#L538-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L528-2true assume !true; 22#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 7#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 25#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 27#L538true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 18#L538-2true [2019-11-20 03:28:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 03:28:40,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034998950] [2019-11-20 03:28:40,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-20 03:28:40,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760004788] [2019-11-20 03:28:40,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:40,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760004788] [2019-11-20 03:28:40,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:40,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:28:40,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510795845] [2019-11-20 03:28:40,473 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 03:28:40,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:28:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:28:40,489 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-20 03:28:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:40,495 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2019-11-20 03:28:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:28:40,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-11-20 03:28:40,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-20 03:28:40,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 32 transitions. [2019-11-20 03:28:40,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-20 03:28:40,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-20 03:28:40,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2019-11-20 03:28:40,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:28:40,504 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-20 03:28:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2019-11-20 03:28:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 03:28:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 03:28:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-11-20 03:28:40,525 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-20 03:28:40,525 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-11-20 03:28:40,525 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 03:28:40,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2019-11-20 03:28:40,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-20 03:28:40,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:28:40,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:28:40,527 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:28:40,527 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:40,527 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 75#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 63#L538-2 [2019-11-20 03:28:40,527 INFO L796 eck$LassoCheckResult]: Loop: 63#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 58#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 59#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 60#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 68#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 72#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 73#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 78#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 63#L538-2 [2019-11-20 03:28:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-20 03:28:40,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444504382] [2019-11-20 03:28:40,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-20 03:28:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300566280] [2019-11-20 03:28:40,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:40,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300566280] [2019-11-20 03:28:40,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:40,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:28:40,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182194312] [2019-11-20 03:28:40,675 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 03:28:40,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:28:40,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:28:40,676 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-20 03:28:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:40,809 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2019-11-20 03:28:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:28:40,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2019-11-20 03:28:40,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-20 03:28:40,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 42 transitions. [2019-11-20 03:28:40,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 03:28:40,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 03:28:40,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 42 transitions. [2019-11-20 03:28:40,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:28:40,816 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-11-20 03:28:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 42 transitions. [2019-11-20 03:28:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-11-20 03:28:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 03:28:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2019-11-20 03:28:40,819 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-20 03:28:40,819 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 36 transitions. [2019-11-20 03:28:40,819 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 03:28:40,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2019-11-20 03:28:40,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-20 03:28:40,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:28:40,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:28:40,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:28:40,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:40,821 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 135#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 123#L538-2 [2019-11-20 03:28:40,821 INFO L796 eck$LassoCheckResult]: Loop: 123#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 117#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 118#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 119#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 128#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 132#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 133#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 138#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 123#L538-2 [2019-11-20 03:28:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,822 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-20 03:28:40,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785598673] [2019-11-20 03:28:40,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,860 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-20 03:28:40,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176655855] [2019-11-20 03:28:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:40,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-20 03:28:40,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:40,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558779139] [2019-11-20 03:28:40,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:41,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558779139] [2019-11-20 03:28:41,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:41,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:28:41,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102397010] [2019-11-20 03:28:41,214 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-20 03:28:41,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:28:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:28:41,293 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-20 03:28:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:41,515 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-11-20 03:28:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:28:41,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2019-11-20 03:28:41,517 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-20 03:28:41,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 58 transitions. [2019-11-20 03:28:41,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-20 03:28:41,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-20 03:28:41,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 58 transitions. [2019-11-20 03:28:41,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:28:41,519 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-20 03:28:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 58 transitions. [2019-11-20 03:28:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-11-20 03:28:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 03:28:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-11-20 03:28:41,523 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-20 03:28:41,523 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-11-20 03:28:41,523 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 03:28:41,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2019-11-20 03:28:41,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 27 [2019-11-20 03:28:41,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:28:41,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:28:41,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 03:28:41,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:41,525 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 214#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~#sentinel~0.base, main_~#sentinel~0.offset, main_~pred~0.base, main_~pred~0.offset, main_~succ~0.base, main_~succ~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L538-2 [2019-11-20 03:28:41,525 INFO L796 eck$LassoCheckResult]: Loop: 215#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 195#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 196#L527-1 assume !main_#t~short6; 197#L527-3 assume !main_#t~short6;havoc main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem4.base, main_#t~mem4.offset; 226#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 224#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 223#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 222#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~nondet16;havoc main_#t~mem15.base, main_#t~mem15.offset; 215#L538-2 [2019-11-20 03:28:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-20 03:28:41,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:41,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915990128] [2019-11-20 03:28:41,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-20 03:28:41,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:41,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565850249] [2019-11-20 03:28:41,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-20 03:28:41,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383536996] [2019-11-20 03:28:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:28:41,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:28:41,766 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-20 03:28:41,892 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 03:28:42,022 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-20 03:28:42,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 03:28:42 BoogieIcfgContainer [2019-11-20 03:28:42,162 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 03:28:42,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:28:42,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:28:42,163 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:28:42,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:40" (3/4) ... [2019-11-20 03:28:42,166 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-20 03:28:42,219 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_da458158-13d3-4b99-9c6f-a9dd28b803db/bin/uautomizer/witness.graphml [2019-11-20 03:28:42,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:28:42,221 INFO L168 Benchmark]: Toolchain (without parser) took 3202.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 905.6 MB in the end (delta: 39.1 MB). Peak memory consumption was 185.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:28:42,221 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:28:42,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:28:42,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:28:42,231 INFO L168 Benchmark]: Boogie Preprocessor took 32.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:28:42,232 INFO L168 Benchmark]: RCFGBuilder took 554.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:28:42,235 INFO L168 Benchmark]: BuchiAutomizer took 1955.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:28:42,236 INFO L168 Benchmark]: Witness Printer took 57.30 ms. Allocated memory is still 1.2 GB. Free memory was 912.3 MB in the beginning and 905.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:28:42,244 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 554.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1955.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.3 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * Witness Printer took 57.30 ms. Allocated memory is still 1.2 GB. Free memory was 912.3 MB in the beginning and 905.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 34 SDslu, 75 SDs, 0 SdLazy, 124 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 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: 525]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@576bdef4=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c424819=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48c879f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38e75ae9=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@557705a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9e8e76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@417e7b70=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2543ef8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@98ace2a=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@733dfee0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@576bdef4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31b5e9c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f82d87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6923e162=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1be35255=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28becb82=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@321f4434=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@733dfee0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ee3f90c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f82d87=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38e75ae9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6923e162=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@417e7b70=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79c7e28d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@98ace2a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@286c7c57=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12d63d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@48c879f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6565b3c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@167202c3=0, sentinel=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b9e8e76=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3629179a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79c7e28d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@321f4434=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@164a6e87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26a3571=0, succ=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@aa429b8=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@12d63d=0, s=0, sentinel=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@712488f9=0, succ=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@557705a9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2543ef8a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3651e235=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3629179a=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@164a6e87=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3651e235=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@712488f9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@dcf4df5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@286c7c57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5ee3f90c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7c424819=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6565b3c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@167202c3=0, pred=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@28becb82=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...