./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/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 dd1b14b919fe0392bfa201e707626cf5228609a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:25:47,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:25:47,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:25:47,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:25:47,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:25:47,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:25:47,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:25:47,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:25:47,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:25:47,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:25:47,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:25:47,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:25:47,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:25:47,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:25:47,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:25:47,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:25:47,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:25:47,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:25:47,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:25:47,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:25:47,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:25:47,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:25:47,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:25:47,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:25:47,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:25:47,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:25:47,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:25:47,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:25:47,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:25:47,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:25:47,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:25:47,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:25:47,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:25:47,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:25:47,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:25:47,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:25:47,391 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:25:47,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:25:47,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:25:47,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:25:47,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:25:47,401 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:25:47,402 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:25:47,402 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:25:47,402 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:25:47,402 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:25:47,402 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:25:47,402 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:25:47,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:25:47,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:25:47,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:25:47,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:25:47,405 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:25:47,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:25:47,405 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:25:47,405 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:25:47,406 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:25:47,406 INFO L133 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/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/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 -> dd1b14b919fe0392bfa201e707626cf5228609a3 [2018-11-18 12:25:47,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:25:47,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:25:47,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:25:47,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:25:47,441 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:25:47,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-18 12:25:47,478 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/data/0cd228b20/815b4f51715544c98bc4787a55034093/FLAG6c3f58913 [2018-11-18 12:25:47,910 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:25:47,911 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/sv-benchmarks/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-18 12:25:47,917 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/data/0cd228b20/815b4f51715544c98bc4787a55034093/FLAG6c3f58913 [2018-11-18 12:25:47,925 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/data/0cd228b20/815b4f51715544c98bc4787a55034093 [2018-11-18 12:25:47,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:25:47,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:25:47,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:25:47,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:25:47,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:25:47,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:25:47" (1/1) ... [2018-11-18 12:25:47,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab0bb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:47, skipping insertion in model container [2018-11-18 12:25:47,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:25:47" (1/1) ... [2018-11-18 12:25:47,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:25:47,969 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:25:48,156 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:25:48,163 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:25:48,192 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:25:48,271 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:25:48,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48 WrapperNode [2018-11-18 12:25:48,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:25:48,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:25:48,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:25:48,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:25:48,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:25:48,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:25:48,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:25:48,308 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:25:48,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... [2018-11-18 12:25:48,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:25:48,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:25:48,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:25:48,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:25:48,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/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 [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:25:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:25:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:25:48,571 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:25:48,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:25:48 BoogieIcfgContainer [2018-11-18 12:25:48,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:25:48,572 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:25:48,573 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:25:48,576 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:25:48,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:25:48,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:25:47" (1/3) ... [2018-11-18 12:25:48,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9cfaf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:25:48, skipping insertion in model container [2018-11-18 12:25:48,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:25:48,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:25:48" (2/3) ... [2018-11-18 12:25:48,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9cfaf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:25:48, skipping insertion in model container [2018-11-18 12:25:48,578 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:25:48,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:25:48" (3/3) ... [2018-11-18 12:25:48,580 INFO L375 chiAutomizerObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-18 12:25:48,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:25:48,625 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:25:48,625 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:25:48,626 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:25:48,626 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:25:48,626 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:25:48,626 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:25:48,626 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:25:48,626 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:25:48,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 12:25:48,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 12:25:48,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:48,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:48,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:25:48,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:25:48,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:25:48,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 12:25:48,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-18 12:25:48,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:48,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:48,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:25:48,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:25:48,674 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 13#L629true assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 19#L629-2true havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 11#L633-3true [2018-11-18 12:25:48,674 INFO L796 eck$LassoCheckResult]: Loop: 11#L633-3true assume true; 5#L633-1true assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 21#L636true assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 25#L636-2true call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 11#L633-3true [2018-11-18 12:25:48,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-18 12:25:48,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:48,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:48,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1422281, now seen corresponding path program 1 times [2018-11-18 12:25:48,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:48,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 265425421, now seen corresponding path program 1 times [2018-11-18 12:25:48,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:48,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:48,971 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-18 12:25:49,117 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:25:49,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:25:49,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:25:49,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:25:49,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:25:49,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:25:49,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:25:49,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:25:49,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i_Iteration1_Lasso [2018-11-18 12:25:49,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:25:49,119 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:25:49,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:25:49,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:25:49,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:25:49,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:25:49,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,516 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 12:25:49,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:25:49,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:25:49,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:25:49,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:25:49,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:25:49,555 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:25:49,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:25:49,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:25:49,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:25:49,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:25:49,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:25:49,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:25:49,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:25:49,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:25:49,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:25:49,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:25:49,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:25:49,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:25:49,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:25:49,593 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:25:49,599 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:25:49,599 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:25:49,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:25:49,601 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:25:49,602 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:25:49,602 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 59 Supporting invariants [] [2018-11-18 12:25:49,607 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 12:25:49,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:49,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:25:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:49,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:25:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:49,669 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:25:49,670 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 4 states. [2018-11-18 12:25:49,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 4 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2018-11-18 12:25:49,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:25:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:25:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-18 12:25:49,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-18 12:25:49,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:25:49,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 12:25:49,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:25:49,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 12:25:49,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:25:49,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2018-11-18 12:25:49,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:25:49,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 19 states and 24 transitions. [2018-11-18 12:25:49,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:25:49,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 12:25:49,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-18 12:25:49,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:25:49,717 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 12:25:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-18 12:25:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 12:25:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 12:25:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-18 12:25:49,736 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 12:25:49,736 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 12:25:49,736 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:25:49,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-18 12:25:49,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 12:25:49,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:49,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:49,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:25:49,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:25:49,738 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 138#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 139#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 136#L633-3 assume true; 130#L633-1 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 131#L633-4 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 129#L645-3 [2018-11-18 12:25:49,738 INFO L796 eck$LassoCheckResult]: Loop: 129#L645-3 assume true; 125#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 127#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 128#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 129#L645-3 [2018-11-18 12:25:49,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1809677371, now seen corresponding path program 1 times [2018-11-18 12:25:49,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:49,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2161065, now seen corresponding path program 1 times [2018-11-18 12:25:49,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:49,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:49,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 202492131, now seen corresponding path program 1 times [2018-11-18 12:25:49,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:49,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:49,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:49,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:49,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:25:49,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:25:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:25:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:25:49,907 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 12:25:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:25:49,973 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 12:25:49,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:25:49,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-11-18 12:25:49,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:49,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 39 transitions. [2018-11-18 12:25:49,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 12:25:49,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 12:25:49,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2018-11-18 12:25:49,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:25:49,978 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-18 12:25:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2018-11-18 12:25:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-11-18 12:25:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:25:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-18 12:25:49,982 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 12:25:49,982 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-18 12:25:49,982 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:25:49,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-18 12:25:49,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:49,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:49,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:49,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:25:49,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-18 12:25:49,984 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 211#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 212#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 208#L633-3 assume true; 201#L633-1 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 202#L633-4 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 207#L645-3 assume true; 197#L645-1 assume !(main_~p~0.base != 0 || main_~p~0.offset != 0); 198#L645-4 main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; 206#L654-3 [2018-11-18 12:25:49,984 INFO L796 eck$LassoCheckResult]: Loop: 206#L654-3 assume true; 205#L654-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset);main_~p~0.base, main_~p~0.offset := main_~tmp~0.base, main_~tmp~0.offset; 206#L654-3 [2018-11-18 12:25:49,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1669099932, now seen corresponding path program 1 times [2018-11-18 12:25:49,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:49,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:49,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:49,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:50,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:25:50,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:25:50,010 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:25:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2983, now seen corresponding path program 1 times [2018-11-18 12:25:50,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:25:50,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:25:50,045 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 12:25:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:25:50,064 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 12:25:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:25:50,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2018-11-18 12:25:50,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:50,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 29 transitions. [2018-11-18 12:25:50,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 12:25:50,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 12:25:50,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-11-18 12:25:50,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:25:50,066 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 12:25:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-11-18 12:25:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-18 12:25:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 12:25:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-18 12:25:50,067 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 12:25:50,067 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-18 12:25:50,067 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:25:50,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-18 12:25:50,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:50,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:50,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:50,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:25:50,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:25:50,069 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 273#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 274#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 271#L633-3 assume true; 265#L633-1 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 266#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 277#L636-2 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 272#L633-3 assume true; 263#L633-1 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 264#L633-4 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 269#L645-3 assume true; 259#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 260#L646 [2018-11-18 12:25:50,069 INFO L796 eck$LassoCheckResult]: Loop: 260#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 261#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 262#L645-3 assume true; 278#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 260#L646 [2018-11-18 12:25:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -775730759, now seen corresponding path program 1 times [2018-11-18 12:25:50,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2556585, now seen corresponding path program 2 times [2018-11-18 12:25:50,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1195290721, now seen corresponding path program 1 times [2018-11-18 12:25:50,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:25:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:25:50,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:25:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:50,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:25:50,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:25:50,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 12:25:50,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:25:50,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:25:50,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:25:50,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-18 12:25:50,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 12:25:50,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:25:50,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2018-11-18 12:25:50,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:25:50,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 12:25:50,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 12:25:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:50,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:25:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 12:25:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:25:50,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:25:50,410 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-18 12:25:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:25:50,499 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-18 12:25:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:25:50,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2018-11-18 12:25:50,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:50,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 33 transitions. [2018-11-18 12:25:50,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 12:25:50,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 12:25:50,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2018-11-18 12:25:50,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:25:50,501 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 12:25:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2018-11-18 12:25:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-11-18 12:25:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 12:25:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-18 12:25:50,503 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 12:25:50,503 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 12:25:50,503 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:25:50,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-18 12:25:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 12:25:50,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:25:50,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:25:50,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:25:50,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:25:50,504 INFO L794 eck$LassoCheckResult]: Stem: 404#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~post4, main_#t~nondet1, main_#t~mem5, main_#t~mem6.base, main_#t~mem6.offset, main_#t~post7, main_#t~mem8.base, main_#t~mem8.offset, main_~tmp~0.base, main_~tmp~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset, main_~p~0.base, main_~p~0.offset, main_~i~0;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; 400#L629 assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); 401#L629-2 havoc main_~t~0.base, main_~t~0.offset;main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 397#L633-3 assume true; 398#L633-1 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 408#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 406#L636-2 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 399#L633-3 assume true; 391#L633-1 assume !!(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1;call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; 392#L636 assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); 405#L636-2 call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 407#L633-3 assume true; 389#L633-1 assume !(main_~i~0 < 30 && 0 != main_#t~nondet1);havoc main_#t~nondet1; 390#L633-4 call write~int(main_~i~0, main_~p~0.base, main_~p~0.offset, 4);call write~$Pointer$(0, 0, main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset;main_~i~0 := 0; 402#L645-3 assume true; 385#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 386#L646 [2018-11-18 12:25:50,504 INFO L796 eck$LassoCheckResult]: Loop: 386#L646 assume !(1 != main_#t~mem5);havoc main_#t~mem5; 387#L646-2 call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 388#L645-3 assume true; 395#L645-1 assume !!(main_~p~0.base != 0 || main_~p~0.offset != 0);call main_#t~mem5 := read~int(main_~p~0.base, main_~p~0.offset, 4); 386#L646 [2018-11-18 12:25:50,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -901850895, now seen corresponding path program 2 times [2018-11-18 12:25:50,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:25:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2556585, now seen corresponding path program 3 times [2018-11-18 12:25:50,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:25:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:25:50,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:25:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1819272089, now seen corresponding path program 2 times [2018-11-18 12:25:50,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:25:50,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:25:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:25:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:25:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:25:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:50,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:25:50,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1f7d83c3-eedc-4b4d-ac5f-f0c8635758e2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:25:50,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:25:50,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:25:50,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:25:50,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:25:50,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:25:50,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 12:25:50,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 12:25:50,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:25:50,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:25:50,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,774 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2018-11-18 12:25:50,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:25:50,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:25:50,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-11-18 12:25:50,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-18 12:25:50,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:25:50,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-18 12:25:50,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 12:25:50,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:44 [2018-11-18 12:25:50,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 12:25:50,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-18 12:25:50,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:15 [2018-11-18 12:25:50,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 12:25:50,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:25:50,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2018-11-18 12:25:50,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:25:50,961 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:25:50,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 12:25:50,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:25:50,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2018-11-18 12:25:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:25:51,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:25:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-18 12:25:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 12:25:51,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-18 12:25:51,047 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 17 states. [2018-11-18 12:25:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:25:51,201 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 12:25:51,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:25:51,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 21 transitions. [2018-11-18 12:25:51,202 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:25:51,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2018-11-18 12:25:51,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:25:51,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:25:51,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:25:51,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:25:51,202 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:25:51,202 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:25:51,202 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:25:51,202 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:25:51,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:25:51,203 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:25:51,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:25:51,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:25:51 BoogieIcfgContainer [2018-11-18 12:25:51,208 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:25:51,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:25:51,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:25:51,208 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:25:51,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:25:48" (3/4) ... [2018-11-18 12:25:51,210 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:25:51,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:25:51,211 INFO L168 Benchmark]: Toolchain (without parser) took 3283.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -93.3 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,212 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:25:51,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.41 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,213 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,213 INFO L168 Benchmark]: RCFGBuilder took 241.53 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,213 INFO L168 Benchmark]: BuchiAutomizer took 2635.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:25:51,214 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:25:51,216 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.41 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.82 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.53 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2635.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 59 and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 4. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 126 SDslu, 101 SDs, 0 SdLazy, 220 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax100 hnf100 lsp93 ukn54 mio100 lsp26 div100 bol100 ite100 ukn100 eq209 hnf91 smp100 dnf166 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...