./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:46:54,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:46:54,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:46:54,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:46:54,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:46:54,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:46:54,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:46:54,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:46:54,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:46:54,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:46:54,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:46:54,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:46:54,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:46:54,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:46:54,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:46:54,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:46:54,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:46:54,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:46:54,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:46:54,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:46:54,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:46:54,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:46:54,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:46:54,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:46:54,400 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:46:54,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:46:54,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:46:54,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:46:54,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:46:54,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:46:54,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:46:54,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:46:54,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:46:54,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:46:54,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:46:54,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:46:54,406 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 14:46:54,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:46:54,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:46:54,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:46:54,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:46:54,418 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:46:54,418 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:46:54,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:46:54,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:46:54,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:46:54,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:46:54,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:46:54,421 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:46:54,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:46:54,422 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2018-11-18 14:46:54,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:46:54,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:46:54,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:46:54,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:46:54,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:46:54,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-18 14:46:54,490 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/data/884de89e1/ad10c3eb9e1040bf84e21be995e32478/FLAGb07796cd2 [2018-11-18 14:46:54,886 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:46:54,886 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/sv-benchmarks/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-18 14:46:54,890 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/data/884de89e1/ad10c3eb9e1040bf84e21be995e32478/FLAGb07796cd2 [2018-11-18 14:46:54,898 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/data/884de89e1/ad10c3eb9e1040bf84e21be995e32478 [2018-11-18 14:46:54,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:46:54,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:46:54,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:46:54,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:46:54,904 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:46:54,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:46:54" (1/1) ... [2018-11-18 14:46:54,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11524d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:54, skipping insertion in model container [2018-11-18 14:46:54,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:46:54" (1/1) ... [2018-11-18 14:46:54,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:46:54,925 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:46:55,037 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:46:55,043 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:46:55,056 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:46:55,067 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:46:55,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55 WrapperNode [2018-11-18 14:46:55,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:46:55,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:46:55,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:46:55,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:46:55,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:46:55,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:46:55,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:46:55,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:46:55,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... [2018-11-18 14:46:55,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:46:55,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:46:55,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:46:55,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:46:55,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:46:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:46:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:46:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:46:55,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:46:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:46:55,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:46:55,466 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:46:55,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:55 BoogieIcfgContainer [2018-11-18 14:46:55,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:46:55,467 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:46:55,467 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:46:55,469 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:46:55,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:46:55,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:46:54" (1/3) ... [2018-11-18 14:46:55,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47049055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:46:55, skipping insertion in model container [2018-11-18 14:46:55,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:46:55,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:46:55" (2/3) ... [2018-11-18 14:46:55,471 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47049055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:46:55, skipping insertion in model container [2018-11-18 14:46:55,471 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:46:55,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:55" (3/3) ... [2018-11-18 14:46:55,472 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2018-11-18 14:46:55,504 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:46:55,504 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:46:55,504 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:46:55,504 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:46:55,504 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:46:55,504 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:46:55,505 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:46:55,505 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:46:55,505 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:46:55,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-18 14:46:55,527 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-18 14:46:55,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:55,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:55,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:46:55,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:46:55,532 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:46:55,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. [2018-11-18 14:46:55,533 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2018-11-18 14:46:55,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:55,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:55,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:46:55,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:46:55,538 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-4true [2018-11-18 14:46:55,538 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-4true assume true; 14#L23-1true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 33#L23-3true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-4true [2018-11-18 14:46:55,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:46:55,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:55,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:55,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 14:46:55,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:55,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 14:46:55,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:55,763 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:46:55,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:46:55,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:46:55,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:46:55,765 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:46:55,765 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:46:55,765 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:46:55,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:46:55,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-18 14:46:55,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:46:55,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:46:55,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:55,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:56,002 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:46:56,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:46:56,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:56,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:56,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:56,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:56,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:56,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:56,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:56,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:56,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:56,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:56,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:56,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:56,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:56,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:56,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:56,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:56,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:56,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,028 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:46:56,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,029 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:46:56,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:56,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:56,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:56,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:56,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:56,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:56,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:56,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:56,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:56,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:46:56,081 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 14:46:56,081 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 14:46:56,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:46:56,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:46:56,085 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:46:56,085 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-18 14:46:56,088 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-18 14:46:56,093 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:46:56,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:46:56,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states. Second operand 4 states. [2018-11-18 14:46:56,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states.. Second operand 4 states. Result 98 states and 131 transitions. Complement of second has 8 states. [2018-11-18 14:46:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:46:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:46:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2018-11-18 14:46:56,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 14:46:56,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:56,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 14:46:56,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:56,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 14:46:56,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:56,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 131 transitions. [2018-11-18 14:46:56,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 31 states and 39 transitions. [2018-11-18 14:46:56,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 14:46:56,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:56,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 14:46:56,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:56,313 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 14:46:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 14:46:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 14:46:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 14:46:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-18 14:46:56,331 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 14:46:56,331 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 14:46:56,331 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:46:56,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-18 14:46:56,332 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:56,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:56,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,332 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 187#L23-4 assume true; 197#L23-1 assume !(main_~i~1 < 5); 198#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 181#L9-4 [2018-11-18 14:46:56,333 INFO L796 eck$LassoCheckResult]: Loop: 181#L9-4 assume true; 182#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 185#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 193#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 183#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 181#L9-4 [2018-11-18 14:46:56,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2018-11-18 14:46:56,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:46:56,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:46:56,360 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:56,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 1 times [2018-11-18 14:46:56,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:46:56,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:46:56,398 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 14:46:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:56,407 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-18 14:46:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:46:56,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2018-11-18 14:46:56,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 40 transitions. [2018-11-18 14:46:56,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 14:46:56,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:56,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2018-11-18 14:46:56,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:56,410 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-18 14:46:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2018-11-18 14:46:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-18 14:46:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 14:46:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-18 14:46:56,413 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 14:46:56,413 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-18 14:46:56,413 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:46:56,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-18 14:46:56,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:56,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:56,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:56,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,415 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 258#L23-4 assume true; 270#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 271#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 280#L23-4 assume true; 268#L23-1 assume !(main_~i~1 < 5); 269#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 252#L9-4 [2018-11-18 14:46:56,415 INFO L796 eck$LassoCheckResult]: Loop: 252#L9-4 assume true; 253#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 256#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 264#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 254#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 252#L9-4 [2018-11-18 14:46:56,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2018-11-18 14:46:56,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:56,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:56,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:56,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 14:46:56,479 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 2 times [2018-11-18 14:46:56,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:46:56,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:46:56,522 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 14:46:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:56,533 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-18 14:46:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:46:56,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-18 14:46:56,534 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-18 14:46:56,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 14:46:56,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:56,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-18 14:46:56,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:56,535 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-18 14:46:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-18 14:46:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 14:46:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 14:46:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-18 14:46:56,537 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-18 14:46:56,537 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-18 14:46:56,537 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:46:56,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2018-11-18 14:46:56,537 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:56,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:56,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-18 14:46:56,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,538 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 360#L23-4 assume true; 377#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 379#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 378#L23-4 assume true; 367#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 368#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 382#L23-4 assume true; 365#L23-1 assume !(main_~i~1 < 5); 366#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 349#L9-4 [2018-11-18 14:46:56,538 INFO L796 eck$LassoCheckResult]: Loop: 349#L9-4 assume true; 350#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 353#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 361#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 351#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 349#L9-4 [2018-11-18 14:46:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1692719029, now seen corresponding path program 2 times [2018-11-18 14:46:56,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:56,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:46:56,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:46:56,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:46:56,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 14:46:56,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:56,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 3 times [2018-11-18 14:46:56,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:46:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:46:56,680 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-18 14:46:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:56,706 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 14:46:56,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:46:56,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-18 14:46:56,708 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 46 transitions. [2018-11-18 14:46:56,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 14:46:56,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:56,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-18 14:46:56,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:56,709 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 14:46:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-18 14:46:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 14:46:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 14:46:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-18 14:46:56,712 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 14:46:56,712 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 14:46:56,712 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:46:56,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2018-11-18 14:46:56,713 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:56,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:56,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1, 1] [2018-11-18 14:46:56,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,713 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 470#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 471#L23-4 assume true; 490#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 492#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 493#L23-4 assume true; 497#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 498#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 491#L23-4 assume true; 480#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 481#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 496#L23-4 assume true; 478#L23-1 assume !(main_~i~1 < 5); 479#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 462#L9-4 [2018-11-18 14:46:56,714 INFO L796 eck$LassoCheckResult]: Loop: 462#L9-4 assume true; 463#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 466#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 474#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 464#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 462#L9-4 [2018-11-18 14:46:56,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,714 INFO L82 PathProgramCache]: Analyzing trace with hash -579836663, now seen corresponding path program 3 times [2018-11-18 14:46:56,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:56,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:46:56,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 14:46:56,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:46:56,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 14:46:56,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:56,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 4 times [2018-11-18 14:46:56,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:46:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:46:56,855 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 14:46:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:56,872 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-18 14:46:56,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:46:56,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-18 14:46:56,875 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 49 transitions. [2018-11-18 14:46:56,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 14:46:56,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:56,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2018-11-18 14:46:56,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:56,877 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 14:46:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2018-11-18 14:46:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-18 14:46:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 14:46:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-18 14:46:56,879 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 14:46:56,879 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 14:46:56,879 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:46:56,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-11-18 14:46:56,880 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:56,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:56,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:56,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2018-11-18 14:46:56,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:56,882 INFO L794 eck$LassoCheckResult]: Stem: 622#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 599#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 600#L23-4 assume true; 619#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 630#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 620#L23-4 assume true; 609#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 610#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 621#L23-4 assume true; 629#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 628#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 627#L23-4 assume true; 625#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 626#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 624#L23-4 assume true; 607#L23-1 assume !(main_~i~1 < 5); 608#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 591#L9-4 [2018-11-18 14:46:56,882 INFO L796 eck$LassoCheckResult]: Loop: 591#L9-4 assume true; 592#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 595#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 603#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 593#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 591#L9-4 [2018-11-18 14:46:56,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 4 times [2018-11-18 14:46:56,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:56,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:56,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 14:46:56,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 14:46:56,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:46:56,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:56,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:56,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 14:46:56,985 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:56,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 5 times [2018-11-18 14:46:56,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:56,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:46:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:46:57,019 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-18 14:46:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:57,033 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-18 14:46:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:46:57,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 52 transitions. [2018-11-18 14:46:57,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:57,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 51 transitions. [2018-11-18 14:46:57,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 14:46:57,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 14:46:57,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2018-11-18 14:46:57,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:57,036 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 14:46:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2018-11-18 14:46:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 14:46:57,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 14:46:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 14:46:57,038 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 14:46:57,038 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 14:46:57,038 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:46:57,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-11-18 14:46:57,039 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-18 14:46:57,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:57,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:57,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1] [2018-11-18 14:46:57,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:57,040 INFO L794 eck$LassoCheckResult]: Stem: 766#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 746#L23-4 assume true; 763#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 764#L23-4 assume true; 753#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 754#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 765#L23-4 assume true; 776#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-4 assume true; 773#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 772#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 771#L23-4 assume true; 769#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 770#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 768#L23-4 assume true; 751#L23-1 assume !(main_~i~1 < 5); 752#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 735#L9-4 [2018-11-18 14:46:57,040 INFO L796 eck$LassoCheckResult]: Loop: 735#L9-4 assume true; 736#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 739#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 747#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 737#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 735#L9-4 [2018-11-18 14:46:57,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1041220151, now seen corresponding path program 5 times [2018-11-18 14:46:57,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash 48826585, now seen corresponding path program 6 times [2018-11-18 14:46:57,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1675634705, now seen corresponding path program 1 times [2018-11-18 14:46:57,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,376 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-18 14:46:57,424 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:46:57,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:46:57,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:46:57,424 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:46:57,424 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:46:57,424 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:46:57,424 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:46:57,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:46:57,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-18 14:46:57,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:46:57,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:46:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:46:57,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:46:57,666 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:46:57,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:57,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:57,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:57,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:57,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:57,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:57,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:46:57,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:46:57,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:46:57,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:46:57,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:46:57,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:46:57,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:46:57,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:46:57,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:46:57,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:46:57,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:46:57,729 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:46:57,736 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 14:46:57,736 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 14:46:57,736 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:46:57,738 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:46:57,738 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:46:57,738 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2018-11-18 14:46:57,748 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 14:46:57,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:57,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:57,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:46:57,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:46:57,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-18 14:46:57,808 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 50 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 50 states and 59 transitions. Complement of second has 7 states. [2018-11-18 14:46:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:46:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:46:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 14:46:57,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-18 14:46:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:57,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-18 14:46:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:57,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-18 14:46:57,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:46:57,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2018-11-18 14:46:57,811 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:57,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 53 transitions. [2018-11-18 14:46:57,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 14:46:57,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 14:46:57,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 53 transitions. [2018-11-18 14:46:57,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:57,812 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 14:46:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 53 transitions. [2018-11-18 14:46:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 14:46:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 14:46:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-18 14:46:57,814 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 14:46:57,814 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 14:46:57,814 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:46:57,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 53 transitions. [2018-11-18 14:46:57,814 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:57,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:57,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:57,815 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:57,815 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:57,815 INFO L794 eck$LassoCheckResult]: Stem: 972#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 952#L23-4 assume true; 969#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 983#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 970#L23-4 assume true; 959#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 960#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 971#L23-4 assume true; 982#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 981#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 980#L23-4 assume true; 979#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 978#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 977#L23-4 assume true; 975#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 976#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 974#L23-4 assume true; 957#L23-1 assume !(main_~i~1 < 5); 958#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 939#L9-4 assume true; 941#L9-1 assume !(max_~i~0 < 5); 944#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 961#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 946#L9-10 [2018-11-18 14:46:57,815 INFO L796 eck$LassoCheckResult]: Loop: 946#L9-10 assume true; 947#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 963#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 966#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 954#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 946#L9-10 [2018-11-18 14:46:57,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1331422194, now seen corresponding path program 1 times [2018-11-18 14:46:57,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:57,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:46:57,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:46:57,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:46:57,846 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 71729905, now seen corresponding path program 1 times [2018-11-18 14:46:57,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:46:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:46:57,893 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-18 14:46:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:57,918 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-18 14:46:57,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:46:57,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 70 transitions. [2018-11-18 14:46:57,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:57,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 59 states and 69 transitions. [2018-11-18 14:46:57,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 14:46:57,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 14:46:57,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 69 transitions. [2018-11-18 14:46:57,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:57,920 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-18 14:46:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 69 transitions. [2018-11-18 14:46:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2018-11-18 14:46:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 14:46:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-18 14:46:57,922 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-18 14:46:57,922 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-18 14:46:57,922 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:46:57,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2018-11-18 14:46:57,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:57,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:57,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:57,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:57,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:57,924 INFO L794 eck$LassoCheckResult]: Stem: 1083#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1062#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1063#L23-4 assume true; 1071#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1072#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1080#L23-4 assume true; 1081#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1096#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1095#L23-4 assume true; 1094#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1093#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1092#L23-4 assume true; 1091#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1090#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1088#L23-4 assume true; 1086#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1087#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1085#L23-4 assume true; 1069#L23-1 assume !(main_~i~1 < 5); 1070#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1050#L9-4 assume true; 1051#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1056#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1064#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1054#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1052#L9-4 assume true; 1053#L9-1 assume !(max_~i~0 < 5); 1055#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1073#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1057#L9-10 assume true; 1058#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1074#L10-3 [2018-11-18 14:46:57,924 INFO L796 eck$LassoCheckResult]: Loop: 1074#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1077#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1065#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1066#L9-10 assume true; 1089#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1074#L10-3 [2018-11-18 14:46:57,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -969979779, now seen corresponding path program 1 times [2018-11-18 14:46:57,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:46:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:57,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:57,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:46:58,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 14:46:58,020 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:58,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 2 times [2018-11-18 14:46:58,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:58,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:46:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:46:58,064 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 14:46:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:58,096 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-11-18 14:46:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:46:58,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 88 transitions. [2018-11-18 14:46:58,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 87 transitions. [2018-11-18 14:46:58,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 14:46:58,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 14:46:58,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 87 transitions. [2018-11-18 14:46:58,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:58,099 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2018-11-18 14:46:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 87 transitions. [2018-11-18 14:46:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-18 14:46:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 14:46:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-18 14:46:58,101 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-18 14:46:58,101 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-18 14:46:58,101 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 14:46:58,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 66 transitions. [2018-11-18 14:46:58,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:58,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:58,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:58,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:58,105 INFO L794 eck$LassoCheckResult]: Stem: 1306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1280#L23-4 assume true; 1292#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1293#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1303#L23-4 assume true; 1304#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1325#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1324#L23-4 assume true; 1323#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1322#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1321#L23-4 assume true; 1319#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1317#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1314#L23-4 assume true; 1312#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1313#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1311#L23-4 assume true; 1290#L23-1 assume !(main_~i~1 < 5); 1291#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1270#L9-4 assume true; 1271#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1310#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1309#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1308#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1272#L9-4 assume true; 1273#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1278#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1286#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1274#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1275#L9-4 assume true; 1276#L9-1 assume !(max_~i~0 < 5); 1277#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1294#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1295#L9-10 assume true; 1296#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1297#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1300#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1287#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1281#L9-10 assume true; 1282#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1316#L10-3 [2018-11-18 14:46:58,105 INFO L796 eck$LassoCheckResult]: Loop: 1316#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1326#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1320#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1318#L9-10 assume true; 1315#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1316#L10-3 [2018-11-18 14:46:58,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -393972629, now seen corresponding path program 1 times [2018-11-18 14:46:58,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 14:46:58,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:58,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:58,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 14:46:58,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:58,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 14:46:58,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:58,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 3 times [2018-11-18 14:46:58,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:46:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:46:58,295 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-18 14:46:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:58,354 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-11-18 14:46:58,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:46:58,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 106 transitions. [2018-11-18 14:46:58,356 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 89 states and 105 transitions. [2018-11-18 14:46:58,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 14:46:58,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-18 14:46:58,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 105 transitions. [2018-11-18 14:46:58,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:58,358 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-11-18 14:46:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 105 transitions. [2018-11-18 14:46:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2018-11-18 14:46:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 14:46:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-11-18 14:46:58,360 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-18 14:46:58,360 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-18 14:46:58,361 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 14:46:58,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2018-11-18 14:46:58,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:58,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:58,363 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:58,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:58,364 INFO L794 eck$LassoCheckResult]: Stem: 1584#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1555#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1556#L23-4 assume true; 1568#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1569#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1581#L23-4 assume true; 1582#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1601#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1600#L23-4 assume true; 1599#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1598#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1597#L23-4 assume true; 1596#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1595#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1593#L23-4 assume true; 1589#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1590#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1588#L23-4 assume true; 1566#L23-1 assume !(main_~i~1 < 5); 1567#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1546#L9-4 assume true; 1547#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1612#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1611#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1610#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1609#L9-4 assume true; 1553#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1554#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1562#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1550#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1548#L9-4 assume true; 1549#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1605#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1604#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1587#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1586#L9-4 assume true; 1551#L9-1 assume !(max_~i~0 < 5); 1552#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1570#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1571#L9-10 assume true; 1572#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1573#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1580#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1563#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1557#L9-10 assume true; 1558#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1608#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1602#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1603#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1607#L9-10 assume true; 1606#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1592#L10-3 [2018-11-18 14:46:58,364 INFO L796 eck$LassoCheckResult]: Loop: 1592#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1576#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1577#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1594#L9-10 assume true; 1591#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1592#L10-3 [2018-11-18 14:46:58,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 97015997, now seen corresponding path program 2 times [2018-11-18 14:46:58,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:46:58,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:58,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:46:58,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:46:58,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:46:58,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 14:46:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 14:46:58,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:58,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 4 times [2018-11-18 14:46:58,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:46:58,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:46:58,522 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-18 14:46:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:58,575 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-18 14:46:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:46:58,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 124 transitions. [2018-11-18 14:46:58,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 123 transitions. [2018-11-18 14:46:58,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-18 14:46:58,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-18 14:46:58,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 123 transitions. [2018-11-18 14:46:58,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:58,578 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 123 transitions. [2018-11-18 14:46:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 123 transitions. [2018-11-18 14:46:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2018-11-18 14:46:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 14:46:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2018-11-18 14:46:58,582 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-11-18 14:46:58,582 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 90 transitions. [2018-11-18 14:46:58,582 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 14:46:58,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 90 transitions. [2018-11-18 14:46:58,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:58,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:58,583 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:58,584 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:58,584 INFO L794 eck$LassoCheckResult]: Stem: 1914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1892#L23-4 assume true; 1910#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1913#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1911#L23-4 assume true; 1899#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1900#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1932#L23-4 assume true; 1931#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1930#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1929#L23-4 assume true; 1928#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1926#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1924#L23-4 assume true; 1920#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1921#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1919#L23-4 assume true; 1897#L23-1 assume !(main_~i~1 < 5); 1898#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1878#L9-4 assume true; 1879#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1885#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1893#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1882#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1880#L9-4 assume true; 1881#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1954#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1953#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1952#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1951#L9-4 assume true; 1950#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1949#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1948#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1946#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1943#L9-4 assume true; 1917#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1935#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1933#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1918#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1916#L9-4 assume true; 1883#L9-1 assume !(max_~i~0 < 5); 1884#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1901#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1902#L9-10 assume true; 1947#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1945#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1944#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1894#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1886#L9-10 assume true; 1887#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1903#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1906#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1907#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1942#L9-10 assume true; 1941#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1940#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1939#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1938#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1937#L9-10 assume true; 1936#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1923#L10-3 [2018-11-18 14:46:58,584 INFO L796 eck$LassoCheckResult]: Loop: 1923#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1934#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 1927#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1925#L9-10 assume true; 1922#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1923#L10-3 [2018-11-18 14:46:58,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash -565394645, now seen corresponding path program 3 times [2018-11-18 14:46:58,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 14:46:58,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:46:58,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74b2f234-e52e-4a05-96e0-d9074b8b4090/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:46:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:46:58,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 14:46:58,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:46:58,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:46:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 14:46:58,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:46:58,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 14:46:58,717 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:46:58,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 5 times [2018-11-18 14:46:58,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:46:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:46:58,761 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-18 14:46:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:58,821 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2018-11-18 14:46:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:46:58,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 130 transitions. [2018-11-18 14:46:58,822 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 110 states and 129 transitions. [2018-11-18 14:46:58,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-18 14:46:58,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-18 14:46:58,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 129 transitions. [2018-11-18 14:46:58,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:58,823 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 129 transitions. [2018-11-18 14:46:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 129 transitions. [2018-11-18 14:46:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2018-11-18 14:46:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 14:46:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2018-11-18 14:46:58,825 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-11-18 14:46:58,825 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-11-18 14:46:58,825 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 14:46:58,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 102 transitions. [2018-11-18 14:46:58,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-18 14:46:58,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:58,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:58,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:58,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 14:46:58,826 INFO L794 eck$LassoCheckResult]: Stem: 2295#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2265#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2266#L23-4 assume true; 2279#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2280#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2290#L23-4 assume true; 2291#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2293#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2294#L23-4 assume true; 2316#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2314#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2313#L23-4 assume true; 2311#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2309#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2307#L23-4 assume true; 2303#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2304#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2302#L23-4 assume true; 2277#L23-1 assume !(main_~i~1 < 5); 2278#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2257#L9-4 assume true; 2258#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2264#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2272#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2261#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2259#L9-4 assume true; 2260#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2343#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2342#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2341#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2340#L9-4 assume true; 2339#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2338#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2337#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2336#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2335#L9-4 assume true; 2334#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2333#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2332#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2331#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2329#L9-4 assume true; 2298#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2301#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2300#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2299#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2297#L9-4 assume true; 2262#L9-1 assume !(max_~i~0 < 5); 2263#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2281#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2267#L9-10 assume true; 2268#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2330#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2286#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2273#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2274#L9-10 assume true; 2282#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2283#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2289#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2328#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2327#L9-10 assume true; 2326#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2325#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2324#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2323#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2322#L9-10 assume true; 2321#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2320#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2319#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2318#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2317#L9-10 assume true; 2315#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2306#L10-3 [2018-11-18 14:46:58,826 INFO L796 eck$LassoCheckResult]: Loop: 2306#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2312#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2310#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2308#L9-10 assume true; 2305#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2306#L10-3 [2018-11-18 14:46:58,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2033469187, now seen corresponding path program 4 times [2018-11-18 14:46:58,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash 79331995, now seen corresponding path program 6 times [2018-11-18 14:46:58,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:58,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1366882529, now seen corresponding path program 1 times [2018-11-18 14:46:58,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:58,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:46:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:46:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 14:46:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:46:59,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 14:46:59,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:46:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:46:59,059 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-18 14:46:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:46:59,211 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-11-18 14:46:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:46:59,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 126 transitions. [2018-11-18 14:46:59,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:46:59,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 81 states and 92 transitions. [2018-11-18 14:46:59,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-18 14:46:59,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-18 14:46:59,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 92 transitions. [2018-11-18 14:46:59,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:46:59,214 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-11-18 14:46:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 92 transitions. [2018-11-18 14:46:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-18 14:46:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-18 14:46:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-11-18 14:46:59,216 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-11-18 14:46:59,216 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-11-18 14:46:59,216 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 14:46:59,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 92 transitions. [2018-11-18 14:46:59,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:46:59,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:46:59,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:46:59,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:46:59,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:46:59,217 INFO L794 eck$LassoCheckResult]: Stem: 2507#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2495#L23-4 assume true; 2496#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2528#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2497#L23-4 assume true; 2498#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2501#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2502#L23-4 assume true; 2525#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2523#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2521#L23-4 assume true; 2519#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2517#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2515#L23-4 assume true; 2512#L23-1 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 2513#L23-3 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2511#L23-4 assume true; 2508#L23-1 assume !(main_~i~1 < 5); 2489#L23-5 assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2490#L9-4 assume true; 2561#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2560#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2559#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2485#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2483#L9-4 assume true; 2484#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2492#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2493#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2494#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2558#L9-4 assume true; 2557#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2556#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2555#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2554#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2553#L9-4 assume true; 2551#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2549#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2547#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2545#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2543#L9-4 assume true; 2541#L9-1 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2539#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2537#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2535#L9-3 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2534#L9-4 assume true; 2532#L9-1 assume !(max_~i~0 < 5); 2510#L9-5 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2509#L12 main_#t~ret6 := max_#res;assume { :end_inline_max } true;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);assume { :begin_inline_max } true;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2503#L9-10 assume true; 2504#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2488#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2481#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2482#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2506#L9-10 assume true; 2552#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2550#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2548#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2546#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2544#L9-10 assume true; 2542#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2540#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2538#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2536#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2533#L9-10 assume true; 2531#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2530#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2529#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2527#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2526#L9-10 assume true; 2524#L9-7 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2522#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2520#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~ite3;havoc max_#t~mem1; 2518#L9-9 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2516#L9-10 assume true; 2514#L9-7 assume !(max_~i~0 < 5); 2499#L9-11 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2500#L12-1 main_#t~ret9 := max_#res;assume { :end_inline_max } true;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 2486#L32-4 [2018-11-18 14:46:59,217 INFO L796 eck$LassoCheckResult]: Loop: 2486#L32-4 assume true; 2487#L32-1 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 2491#L32-3 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 2486#L32-4 [2018-11-18 14:46:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1834077631, now seen corresponding path program 1 times [2018-11-18 14:46:59,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:59,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 98470, now seen corresponding path program 1 times [2018-11-18 14:46:59,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:59,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:46:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1567303270, now seen corresponding path program 1 times [2018-11-18 14:46:59,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:46:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:46:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:46:59,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:46:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:46:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:47:01,487 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 369 DAG size of output: 281 [2018-11-18 14:47:01,796 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2018-11-18 14:47:01,798 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:47:01,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:47:01,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:47:01,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:47:01,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:47:01,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:47:01,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:47:01,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:47:01,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-18 14:47:01,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:47:01,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:47:01,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:01,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:47:02,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:47:02,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:47:02,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:47:02,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:47:02,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:47:02,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:47:02,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:47:02,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:47:02,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:47:02,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:47:02,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:47:02,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:47:02,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:47:02,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:47:02,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:47:02,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:47:02,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:47:02,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:47:02,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:47:02,264 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:47:02,271 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 14:47:02,271 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 14:47:02,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:47:02,272 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:47:02,272 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:47:02,273 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3, ULTIMATE.start_main_~i~2) = 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2018-11-18 14:47:02,338 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-18 14:47:02,339 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:47:02,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:47:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:02,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:47:02,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:47:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:47:02,388 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:47:02,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 92 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 14:47:02,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 92 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 84 states and 96 transitions. Complement of second has 6 states. [2018-11-18 14:47:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:47:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:47:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-18 14:47:02,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 78 letters. Loop has 3 letters. [2018-11-18 14:47:02,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:47:02,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 81 letters. Loop has 3 letters. [2018-11-18 14:47:02,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:47:02,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 78 letters. Loop has 6 letters. [2018-11-18 14:47:02,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:47:02,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 96 transitions. [2018-11-18 14:47:02,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:47:02,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:47:02,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:47:02,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:47:02,398 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 14:47:02,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:47:02,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:47:02,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:47:02,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:47:02 BoogieIcfgContainer [2018-11-18 14:47:02,404 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:47:02,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:47:02,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:47:02,404 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:47:02,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:46:55" (3/4) ... [2018-11-18 14:47:02,408 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:47:02,408 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:47:02,408 INFO L168 Benchmark]: Toolchain (without parser) took 7507.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 962.5 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,409 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:47:02,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.29 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 951.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,410 INFO L168 Benchmark]: Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,410 INFO L168 Benchmark]: RCFGBuilder took 309.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,411 INFO L168 Benchmark]: BuchiAutomizer took 6936.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:47:02,411 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:47:02,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.29 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 951.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 309.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6936.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 169.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function 7 * unknown-#length-unknown[x] + -16 * i and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 15 iterations. TraceHistogramMax:6. Analysis of lassos took 5.9s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 110 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 87 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 427 SDtfs, 479 SDslu, 943 SDs, 0 SdLazy, 434 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital206 mio100 ax100 hnf100 lsp94 ukn51 mio100 lsp61 div100 bol100 ite100 ukn100 eq156 hnf88 smp96 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...