./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb5770b8d32c05b82025135c2b222cf31b0a4100 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:30:23,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:30:23,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:30:23,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:30:23,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:30:23,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:30:23,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:30:23,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:30:23,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:30:23,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:30:23,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:30:23,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:30:23,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:30:23,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:30:23,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:30:23,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:30:23,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:30:23,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:30:23,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:30:23,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:30:23,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:30:23,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:30:23,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:30:23,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:30:23,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:30:23,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:30:23,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:30:23,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:30:23,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:30:23,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:30:23,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:30:23,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:30:23,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:30:23,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:30:23,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:30:23,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:30:23,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:30:23,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:30:23,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:30:23,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:30:23,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:30:23,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:30:23,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:30:23,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:30:23,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:30:23,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:30:23,331 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:30:23,331 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:30:23,331 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:30:23,332 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:30:23,332 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:30:23,332 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:30:23,332 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:30:23,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:30:23,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:30:23,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:30:23,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:30:23,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:30:23,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:30:23,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:30:23,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:30:23,334 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:30:23,334 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:30:23,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:30:23,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:30:23,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:30:23,335 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:30:23,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:30:23,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:30:23,336 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:30:23,347 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:30:23,347 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2019-11-15 23:30:23,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:30:23,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:30:23,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:30:23,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:30:23,402 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:30:23,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-15 23:30:23,456 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/data/a7d8aef83/f6a6a29a839944429dca98b0c9a5a80f/FLAG8352f6891 [2019-11-15 23:30:23,940 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:30:23,941 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-15 23:30:23,956 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/data/a7d8aef83/f6a6a29a839944429dca98b0c9a5a80f/FLAG8352f6891 [2019-11-15 23:30:24,257 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/data/a7d8aef83/f6a6a29a839944429dca98b0c9a5a80f [2019-11-15 23:30:24,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:30:24,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:30:24,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:24,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:30:24,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:30:24,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f8962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24, skipping insertion in model container [2019-11-15 23:30:24,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:30:24,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:30:24,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:24,642 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:30:24,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:24,764 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:30:24,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24 WrapperNode [2019-11-15 23:30:24,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:24,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:30:24,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:30:24,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:30:24,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:30:24,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:30:24,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:30:24,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:30:24,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... [2019-11-15 23:30:24,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:30:24,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:30:24,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:30:24,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:30:24,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:30:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:30:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:30:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:30:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:30:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:30:24,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:30:25,359 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:30:25,359 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-15 23:30:25,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:25 BoogieIcfgContainer [2019-11-15 23:30:25,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:30:25,361 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:30:25,361 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:30:25,364 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:30:25,365 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:25,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:30:24" (1/3) ... [2019-11-15 23:30:25,366 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65072687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:30:25, skipping insertion in model container [2019-11-15 23:30:25,366 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:25,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:24" (2/3) ... [2019-11-15 23:30:25,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65072687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:30:25, skipping insertion in model container [2019-11-15 23:30:25,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:25,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:25" (3/3) ... [2019-11-15 23:30:25,371 INFO L371 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2019-11-15 23:30:25,415 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:30:25,416 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:30:25,416 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:30:25,416 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:30:25,416 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:30:25,416 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:30:25,417 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:30:25,417 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:30:25,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 23:30:25,452 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-15 23:30:25,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:25,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:25,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:30:25,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:30:25,457 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:30:25,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 23:30:25,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-15 23:30:25,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:25,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:25,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:30:25,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:30:25,466 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2019-11-15 23:30:25,466 INFO L793 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2019-11-15 23:30:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2019-11-15 23:30:25,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:25,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750777202] [2019-11-15 23:30:25,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:25,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2019-11-15 23:30:25,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:25,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147461769] [2019-11-15 23:30:25,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:25,688 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2019-11-15 23:30:25,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:25,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364082097] [2019-11-15 23:30:25,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:25,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:25,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364082097] [2019-11-15 23:30:25,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:25,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:30:25,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810872370] [2019-11-15 23:30:25,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:30:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:30:26,004 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-11-15 23:30:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:26,186 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-11-15 23:30:26,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:30:26,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-15 23:30:26,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:26,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2019-11-15 23:30:26,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 23:30:26,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 23:30:26,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-15 23:30:26,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:30:26,204 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 23:30:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-15 23:30:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2019-11-15 23:30:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:30:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 23:30:26,236 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:30:26,236 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:30:26,236 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:30:26,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-15 23:30:26,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:26,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:26,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:26,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:30:26,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:30:26,245 INFO L791 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 81#L567-2 [2019-11-15 23:30:26,246 INFO L793 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 81#L567-2 [2019-11-15 23:30:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:26,247 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2019-11-15 23:30:26,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:26,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134282067] [2019-11-15 23:30:26,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2019-11-15 23:30:26,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:26,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056075435] [2019-11-15 23:30:26,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:26,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056075435] [2019-11-15 23:30:26,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:26,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:30:26,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205560708] [2019-11-15 23:30:26,404 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:30:26,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:30:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:30:26,404 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 23:30:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:26,437 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-11-15 23:30:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:30:26,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-11-15 23:30:26,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:26,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-11-15 23:30:26,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:30:26,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 23:30:26,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-11-15 23:30:26,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:30:26,441 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 23:30:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-11-15 23:30:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 23:30:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:30:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-15 23:30:26,443 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 23:30:26,443 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 23:30:26,444 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:30:26,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-11-15 23:30:26,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:26,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:26,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:26,445 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:30:26,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:30:26,445 INFO L791 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 127#L567-2 [2019-11-15 23:30:26,445 INFO L793 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 127#L567-2 [2019-11-15 23:30:26,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:26,446 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2019-11-15 23:30:26,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:26,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240493661] [2019-11-15 23:30:26,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,496 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2019-11-15 23:30:26,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:26,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471666816] [2019-11-15 23:30:26,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,519 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2019-11-15 23:30:26,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:26,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507397627] [2019-11-15 23:30:26,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:26,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:26,623 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:26,772 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-11-15 23:30:28,013 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-11-15 23:30:28,531 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-15 23:30:28,544 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:30:28,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:30:28,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:30:28,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:30:28,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:30:28,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:30:28,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:30:28,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:30:28,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2019-11-15 23:30:28,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:30:28,546 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:30:28,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:28,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,541 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 [2019-11-15 23:30:29,707 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-15 23:30:29,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:29,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:32,660 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 23:30:32,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:30:32,754 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:30:32,756 INFO L120 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 [2019-11-15 23:30:32,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:32,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:32,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:32,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,764 INFO L120 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 [2019-11-15 23:30:32,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,768 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,768 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,771 INFO L120 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 [2019-11-15 23:30:32,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:32,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:32,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:32,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,774 INFO L120 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 [2019-11-15 23:30:32,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:32,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:32,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:32,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,777 INFO L120 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 [2019-11-15 23:30:32,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:32,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:32,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:32,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,785 INFO L120 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 [2019-11-15 23:30:32,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,788 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,789 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,793 INFO L120 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 [2019-11-15 23:30:32,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:32,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,796 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:32,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:32,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,801 INFO L120 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 [2019-11-15 23:30:32,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,805 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,809 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,820 INFO L120 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 [2019-11-15 23:30:32,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,835 INFO L120 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 [2019-11-15 23:30:32,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,847 INFO L120 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 [2019-11-15 23:30:32,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,854 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,854 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,892 INFO L120 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 [2019-11-15 23:30:32,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,900 INFO L120 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 [2019-11-15 23:30:32,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,906 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,912 INFO L120 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 [2019-11-15 23:30:32,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,914 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,915 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:32,919 INFO L120 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 [2019-11-15 23:30:32,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:32,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:32,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:32,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:32,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:32,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:32,956 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:30:32,974 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:30:32,974 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:30:32,976 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:30:32,977 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:30:32,978 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:30:32,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2019-11-15 23:30:33,284 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2019-11-15 23:30:33,304 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:30:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:30:33,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:33,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:33,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 62 [2019-11-15 23:30:33,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:33,563 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 23:30:33,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:33,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:33,646 INFO L341 Elim1Store]: treesize reduction 161, result has 15.3 percent of original size [2019-11-15 23:30:33,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 36 [2019-11-15 23:30:33,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:33,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:33,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:33,692 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:298, output treesize:58 [2019-11-15 23:30:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:33,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:30:33,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:33,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:30:33,881 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-15 23:30:33,995 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 10 states. [2019-11-15 23:30:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:30:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:30:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:30:33,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:30:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:30:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:33,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-15 23:30:33,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:34,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-11-15 23:30:34,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:34,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 33 transitions. [2019-11-15 23:30:34,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:30:34,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 23:30:34,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-11-15 23:30:34,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:34,002 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-15 23:30:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-11-15 23:30:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-15 23:30:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:30:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 23:30:34,005 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 23:30:34,005 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 23:30:34,005 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:30:34,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-15 23:30:34,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:34,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:34,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:34,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:30:34,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:30:34,007 INFO L791 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 512#L-1 havoc main_#res;havoc main_#t~nondet21; 501#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 498#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 499#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 500#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 506#L567-5 [2019-11-15 23:30:34,008 INFO L793 eck$LassoCheckResult]: Loop: 506#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 518#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 519#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 514#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 506#L567-5 [2019-11-15 23:30:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2019-11-15 23:30:34,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:34,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981827111] [2019-11-15 23:30:34,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:34,049 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2019-11-15 23:30:34,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:34,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638365637] [2019-11-15 23:30:34,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,060 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2019-11-15 23:30:34,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:34,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876432212] [2019-11-15 23:30:34,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:34,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:34,102 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:34,243 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-11-15 23:30:35,210 WARN L191 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 132 [2019-11-15 23:30:35,558 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-11-15 23:30:35,561 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:30:35,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:30:35,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:30:35,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:30:35,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:30:35,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:30:35,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:30:35,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:30:35,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration4_Lasso [2019-11-15 23:30:35,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:30:35,562 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:30:35,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:35,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,302 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2019-11-15 23:30:36,475 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-15 23:30:36,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:36,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:39,308 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 23:30:39,402 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:30:39,402 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:30:39,403 INFO L120 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 [2019-11-15 23:30:39,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,406 INFO L120 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 [2019-11-15 23:30:39,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,407 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,408 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,408 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,409 INFO L120 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 [2019-11-15 23:30:39,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,411 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,411 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,412 INFO L120 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 [2019-11-15 23:30:39,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,416 INFO L120 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 [2019-11-15 23:30:39,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,418 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,418 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,419 INFO L120 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 [2019-11-15 23:30:39,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,424 INFO L120 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 [2019-11-15 23:30:39,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,427 INFO L120 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 [2019-11-15 23:30:39,427 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,427 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,428 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,428 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,428 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,428 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,429 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,430 INFO L120 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 [2019-11-15 23:30:39,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,434 INFO L120 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 [2019-11-15 23:30:39,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,435 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,437 INFO L120 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 [2019-11-15 23:30:39,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,438 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,439 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,440 INFO L120 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 [2019-11-15 23:30:39,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,442 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,443 INFO L120 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 [2019-11-15 23:30:39,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:39,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,445 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:39,445 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:39,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,447 INFO L120 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 [2019-11-15 23:30:39,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,449 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,449 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,451 INFO L120 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 [2019-11-15 23:30:39,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,452 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,473 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,481 INFO L120 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 [2019-11-15 23:30:39,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,495 INFO L120 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 [2019-11-15 23:30:39,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,499 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,499 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,501 INFO L120 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 [2019-11-15 23:30:39,503 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,503 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,503 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,503 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,514 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:39,538 INFO L120 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 [2019-11-15 23:30:39,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:39,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:39,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:39,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:39,542 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:39,542 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:39,567 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:30:39,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:30:39,574 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:30:39,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:30:39,575 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:30:39,576 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:30:39,576 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2019-11-15 23:30:39,775 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2019-11-15 23:30:39,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:30:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:39,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 23:30:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:39,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:39,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2019-11-15 23:30:39,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:40,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:40,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2019-11-15 23:30:40,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:40,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:40,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:40,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2019-11-15 23:30:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:40,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:30:40,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:40,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:40,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:30:40,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 23:30:40,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2019-11-15 23:30:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:30:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:30:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 23:30:40,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:30:40,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:40,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:30:40,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:40,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-15 23:30:40,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:40,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-15 23:30:40,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:40,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2019-11-15 23:30:40,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:30:40,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 23:30:40,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2019-11-15 23:30:40,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:40,993 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-15 23:30:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2019-11-15 23:30:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-11-15 23:30:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 23:30:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-15 23:30:40,996 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 23:30:40,996 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 23:30:40,996 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:30:40,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-11-15 23:30:40,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:40,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:40,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:40,998 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:40,998 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:30:40,999 INFO L791 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 881#L-1 havoc main_#res;havoc main_#t~nondet21; 867#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 860#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 861#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 886#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 887#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 873#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 874#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 868#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-11-15 23:30:40,999 INFO L793 eck$LassoCheckResult]: Loop: 862#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem16;havoc f_#t~mem15;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 863#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 877#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 892#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 891#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 862#L568 [2019-11-15 23:30:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2019-11-15 23:30:41,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:41,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576815984] [2019-11-15 23:30:41,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:41,031 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2019-11-15 23:30:41,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:41,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447875679] [2019-11-15 23:30:41,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:41,045 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2019-11-15 23:30:41,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:41,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664333045] [2019-11-15 23:30:41,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:41,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664333045] [2019-11-15 23:30:41,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453028835] [2019-11-15 23:30:41,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:41,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 23:30:41,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:41,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:41,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2019-11-15 23:30:41,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:41,699 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 23:30:41,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:41,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2019-11-15 23:30:41,709 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:41,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:41,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:41,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:308, output treesize:82 [2019-11-15 23:30:41,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:41,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:41,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 57 [2019-11-15 23:30:41,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:41,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:41,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:41,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:237, output treesize:59 [2019-11-15 23:30:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:41,961 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:41,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-15 23:30:41,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284273767] [2019-11-15 23:30:42,152 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:30:42,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:30:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:30:42,227 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 10 states. [2019-11-15 23:30:42,371 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-15 23:30:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:42,855 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-15 23:30:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:30:42,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 60 transitions. [2019-11-15 23:30:42,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:42,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 48 transitions. [2019-11-15 23:30:42,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:30:42,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 23:30:42,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2019-11-15 23:30:42,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:42,859 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 23:30:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2019-11-15 23:30:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-15 23:30:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:30:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-11-15 23:30:42,862 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 23:30:42,862 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-11-15 23:30:42,863 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:30:42,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2019-11-15 23:30:42,863 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:42,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:42,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:42,864 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:42,864 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:30:42,866 INFO L791 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1042#L-1 havoc main_#res;havoc main_#t~nondet21; 1025#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1024#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1022#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1023#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1050#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1047#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1048#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1039#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1029#L568-1 [2019-11-15 23:30:42,876 INFO L793 eck$LassoCheckResult]: Loop: 1029#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem16;havoc f_#t~mem15;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1030#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1045#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1054#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1053#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1029#L568-1 [2019-11-15 23:30:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718863, now seen corresponding path program 1 times [2019-11-15 23:30:42,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:42,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411981221] [2019-11-15 23:30:42,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:42,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2019-11-15 23:30:42,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:42,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665354748] [2019-11-15 23:30:42,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:42,968 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -588680336, now seen corresponding path program 1 times [2019-11-15 23:30:42,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:42,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166082634] [2019-11-15 23:30:42,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:42,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:43,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166082634] [2019-11-15 23:30:43,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364000984] [2019-11-15 23:30:43,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:43,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 23:30:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:43,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:43,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2019-11-15 23:30:43,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:43,428 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 23:30:43,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:43,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:43,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:43,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 52 [2019-11-15 23:30:43,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:43,559 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-15 23:30:43,559 INFO L567 ElimStorePlain]: treesize reduction 20, result has 80.0 percent of original size [2019-11-15 23:30:43,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:43,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:43,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:306, output treesize:77 [2019-11-15 23:30:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:43,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:43,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:43,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:43,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:30:43,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 70 [2019-11-15 23:30:43,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:43,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:43,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:30:44,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:44,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 152 [2019-11-15 23:30:44,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:44,203 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-11-15 23:30:44,203 INFO L567 ElimStorePlain]: treesize reduction 103, result has 52.3 percent of original size [2019-11-15 23:30:44,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 23:30:44,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:446, output treesize:71 [2019-11-15 23:30:44,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:44,248 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:44,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-11-15 23:30:44,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420874849] [2019-11-15 23:30:44,416 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:30:44,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:30:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:30:44,471 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-11-15 23:30:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:44,848 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-15 23:30:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:30:44,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2019-11-15 23:30:44,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:44,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 46 states and 51 transitions. [2019-11-15 23:30:44,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:30:44,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-15 23:30:44,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2019-11-15 23:30:44,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:44,852 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-11-15 23:30:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2019-11-15 23:30:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-15 23:30:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:30:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-15 23:30:44,855 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-15 23:30:44,856 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-15 23:30:44,856 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:30:44,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2019-11-15 23:30:44,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:30:44,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:44,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:44,858 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:44,858 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:30:44,858 INFO L791 eck$LassoCheckResult]: Stem: 1204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1203#L-1 havoc main_#res;havoc main_#t~nondet21; 1186#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1179#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1180#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1208#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1209#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1214#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1221#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1220#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1197#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1194#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1195#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1188#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1189#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1192#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1193#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1187#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1181#L568 [2019-11-15 23:30:44,858 INFO L793 eck$LassoCheckResult]: Loop: 1181#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem16;havoc f_#t~mem15;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1182#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1196#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1198#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1199#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1181#L568 [2019-11-15 23:30:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1529889349, now seen corresponding path program 1 times [2019-11-15 23:30:44,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:44,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225082674] [2019-11-15 23:30:44,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:44,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:44,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:45,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225082674] [2019-11-15 23:30:45,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670855908] [2019-11-15 23:30:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_105f5f58-6950-4416-b835-31e75a34d920/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:45,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 23:30:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:45,235 INFO L341 Elim1Store]: treesize reduction 184, result has 13.6 percent of original size [2019-11-15 23:30:45,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 251 treesize of output 36 [2019-11-15 23:30:45,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:45,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:45,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:30:45,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:258, output treesize:42 [2019-11-15 23:30:45,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:45,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2019-11-15 23:30:45,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:45,315 INFO L567 ElimStorePlain]: treesize reduction 30, result has 45.5 percent of original size [2019-11-15 23:30:45,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:45,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-15 23:30:45,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:30:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:30:45,370 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:45,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-11-15 23:30:45,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604385079] [2019-11-15 23:30:45,371 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:30:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 2 times [2019-11-15 23:30:45,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:45,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782465468] [2019-11-15 23:30:45,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:45,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:45,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:45,382 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:45,559 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-15 23:30:45,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:30:45,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:30:45,610 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-15 23:30:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:45,912 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-11-15 23:30:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:30:45,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 22 transitions. [2019-11-15 23:30:45,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:30:45,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-11-15 23:30:45,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:30:45,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:30:45,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:30:45,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:30:45,914 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:30:45,914 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:30:45,914 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:30:45,914 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:30:45,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:30:45,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:30:45,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:30:45,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:30:45 BoogieIcfgContainer [2019-11-15 23:30:45,920 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:30:45,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:30:45,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:30:45,921 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:30:45,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:25" (3/4) ... [2019-11-15 23:30:45,924 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:30:45,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:30:45,926 INFO L168 Benchmark]: Toolchain (without parser) took 21665.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 944.7 MB in the beginning and 999.0 MB in the end (delta: -54.3 MB). Peak memory consumption was 295.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:45,926 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:30:45,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:45,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:30:45,927 INFO L168 Benchmark]: Boogie Preprocessor took 30.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:45,928 INFO L168 Benchmark]: RCFGBuilder took 511.18 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:45,928 INFO L168 Benchmark]: BuchiAutomizer took 20559.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 85.5 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:30:45,929 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 999.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:30:45,931 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 503.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 511.18 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20559.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 85.5 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 999.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 16.8s. Construction of modules took 1.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 118 SDslu, 253 SDs, 0 SdLazy, 388 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital560 mio100 ax103 hnf100 lsp93 ukn46 mio100 lsp31 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf1563 smp89 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...