./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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 d0de1e24b39a951a670bac9cdad830e10aacf376 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 15:48:25,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:48:25,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:48:25,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:48:25,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:48:25,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:48:25,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:48:25,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:48:25,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:48:25,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:48:25,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:48:25,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:48:25,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:48:25,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:48:25,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:48:25,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:48:25,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:48:25,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:48:25,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:48:25,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:48:25,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:48:25,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:48:25,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:48:25,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:48:25,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:48:25,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:48:25,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:48:25,211 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:48:25,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:48:25,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:48:25,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:48:25,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:48:25,213 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:48:25,213 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:48:25,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:48:25,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:48:25,214 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 15:48:25,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:48:25,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:48:25,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 15:48:25,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 15:48:25,226 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 15:48:25,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 15:48:25,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:48:25,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 15:48:25,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 15:48:25,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 15:48:25,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:48:25,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 15:48:25,230 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 15:48:25,230 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 15:48:25,230 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_9d40a630-40e3-4533-b457-b777b6379d28/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 -> d0de1e24b39a951a670bac9cdad830e10aacf376 [2018-12-08 15:48:25,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:48:25,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:48:25,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:48:25,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:48:25,264 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:48:25,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-12-08 15:48:25,298 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/data/797827762/bae602d272994bedb811a24204fb5542/FLAGba4e46edf [2018-12-08 15:48:25,615 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:48:25,616 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/sv-benchmarks/c/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-12-08 15:48:25,619 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/data/797827762/bae602d272994bedb811a24204fb5542/FLAGba4e46edf [2018-12-08 15:48:26,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/bin-2019/uautomizer/data/797827762/bae602d272994bedb811a24204fb5542 [2018-12-08 15:48:26,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:48:26,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:48:26,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:48:26,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:48:26,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:48:26,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf9aced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26, skipping insertion in model container [2018-12-08 15:48:26,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:48:26,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:48:26,147 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:48:26,153 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:48:26,165 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:48:26,174 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:48:26,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26 WrapperNode [2018-12-08 15:48:26,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:48:26,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:48:26,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:48:26,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:48:26,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:48:26,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:48:26,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:48:26,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:48:26,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... [2018-12-08 15:48:26,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:48:26,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:48:26,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:48:26,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:48:26,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 15:48:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:48:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:48:26,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:48:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 15:48:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 15:48:26,434 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:48:26,434 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-08 15:48:26,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:48:26 BoogieIcfgContainer [2018-12-08 15:48:26,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:48:26,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 15:48:26,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 15:48:26,437 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 15:48:26,438 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 15:48:26,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 03:48:26" (1/3) ... [2018-12-08 15:48:26,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6badcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 03:48:26, skipping insertion in model container [2018-12-08 15:48:26,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 15:48:26,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:48:26" (2/3) ... [2018-12-08 15:48:26,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6badcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 03:48:26, skipping insertion in model container [2018-12-08 15:48:26,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 15:48:26,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:48:26" (3/3) ... [2018-12-08 15:48:26,441 INFO L375 chiAutomizerObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-12-08 15:48:26,474 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 15:48:26,475 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 15:48:26,475 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 15:48:26,475 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 15:48:26,475 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:48:26,475 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:48:26,475 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 15:48:26,476 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:48:26,476 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 15:48:26,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-12-08 15:48:26,497 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 15:48:26,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:26,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:26,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 15:48:26,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 15:48:26,502 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 15:48:26,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-12-08 15:48:26,503 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-12-08 15:48:26,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:26,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:26,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 15:48:26,504 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 15:48:26,509 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true 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; 28#L26-3true [2018-12-08 15:48:26,509 INFO L796 eck$LassoCheckResult]: Loop: 28#L26-3true 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; 29#L26-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 28#L26-3true [2018-12-08 15:48:26,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 15:48:26,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:26,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:26,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-08 15:48:26,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:26,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:26,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-08 15:48:26,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:26,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:26,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:26,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:26,685 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 15:48:26,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 15:48:26,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 15:48:26,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 15:48:26,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 15:48:26,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 15:48:26,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 15:48:26,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 15:48:26,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-08 15:48:26,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 15:48:26,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 15:48:26,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:26,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 15:48:26,853 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 15:48:26,854 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-12-08 15:48:26,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,860 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-12-08 15:48:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,862 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-12-08 15:48:26,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,863 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-12-08 15:48:26,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,865 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-12-08 15:48:26,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,867 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-12-08 15:48:26,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,868 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-12-08 15:48:26,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:26,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,873 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-12-08 15:48:26,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,875 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-12-08 15:48:26,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,876 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-12-08 15:48:26,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,878 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-12-08 15:48:26,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,879 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-12-08 15:48:26,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,881 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-12-08 15:48:26,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:26,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,884 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-12-08 15:48:26,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,886 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-12-08 15:48:26,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,886 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 15:48:26,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,887 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 15:48:26,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,891 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-12-08 15:48:26,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,894 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-12-08 15:48:26,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:26,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,897 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-12-08 15:48:26,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:26,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,905 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-12-08 15:48:26,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:26,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:26,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:26,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:26,907 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-12-08 15:48:26,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:26,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:26,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:26,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:26,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:26,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:26,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 15:48:26,946 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-08 15:48:26,946 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-08 15:48:26,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 15:48:26,949 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 15:48:26,949 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 15:48:26,949 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-12-08 15:48:26,951 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-08 15:48:26,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 15:48:26,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:26,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:26,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,017 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-12-08 15:48:27,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2018-12-08 15:48:27,078 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 110 transitions. Complement of second has 8 states. [2018-12-08 15:48:27,079 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-12-08 15:48:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 15:48:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2018-12-08 15:48:27,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-08 15:48:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-08 15:48:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:27,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-08 15:48:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:27,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 110 transitions. [2018-12-08 15:48:27,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 30 transitions. [2018-12-08 15:48:27,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 15:48:27,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-12-08 15:48:27,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,091 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 15:48:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-12-08 15:48:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-08 15:48:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 15:48:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-12-08 15:48:27,109 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 15:48:27,109 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-08 15:48:27,109 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 15:48:27,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-12-08 15:48:27,110 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 15:48:27,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,111 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 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; 160#L26-3 assume !(main_~i~1 < 5); 164#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 150#L7-3 [2018-12-08 15:48:27,111 INFO L796 eck$LassoCheckResult]: Loop: 150#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 156#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 149#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 150#L7-3 [2018-12-08 15:48:27,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-08 15:48:27,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:48:27,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:48:27,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:27,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2018-12-08 15:48:27,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:27,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:48:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:48:27,218 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 15:48:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:27,228 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-12-08 15:48:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:48:27,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-08 15:48:27,229 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-12-08 15:48:27,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 15:48:27,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-12-08 15:48:27,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,230 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-08 15:48:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-12-08 15:48:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-08 15:48:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-08 15:48:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2018-12-08 15:48:27,232 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-12-08 15:48:27,232 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-12-08 15:48:27,232 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 15:48:27,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2018-12-08 15:48:27,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 15:48:27,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,233 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 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; 210#L26-3 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; 216#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 217#L26-3 assume !(main_~i~1 < 5); 215#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 202#L7-3 [2018-12-08 15:48:27,233 INFO L796 eck$LassoCheckResult]: Loop: 202#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 207#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 201#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 202#L7-3 [2018-12-08 15:48:27,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-08 15:48:27,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:27,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:27,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:27,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:27,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 15:48:27,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:27,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2018-12-08 15:48:27,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:27,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:48:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:48:27,330 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-08 15:48:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:27,341 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2018-12-08 15:48:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:48:27,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2018-12-08 15:48:27,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2018-12-08 15:48:27,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 15:48:27,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-12-08 15:48:27,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,343 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-08 15:48:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-12-08 15:48:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-08 15:48:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 15:48:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-12-08 15:48:27,344 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-08 15:48:27,345 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2018-12-08 15:48:27,345 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 15:48:27,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2018-12-08 15:48:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-08 15:48:27,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,346 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 280#L-1 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; 281#L26-3 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; 286#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 287#L26-3 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; 288#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 291#L26-3 assume !(main_~i~1 < 5); 285#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 271#L7-3 [2018-12-08 15:48:27,346 INFO L796 eck$LassoCheckResult]: Loop: 271#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 277#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 270#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 271#L7-3 [2018-12-08 15:48:27,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-08 15:48:27,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:27,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:27,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 15:48:27,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:48:27,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:27,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:27,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 15:48:27,399 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:27,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2018-12-08 15:48:27,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:48:27,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:48:27,448 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-12-08 15:48:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:27,460 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-08 15:48:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:48:27,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-08 15:48:27,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2018-12-08 15:48:27,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 15:48:27,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-12-08 15:48:27,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,461 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-08 15:48:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-12-08 15:48:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-08 15:48:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 15:48:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-08 15:48:27,463 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-08 15:48:27,463 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-08 15:48:27,463 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 15:48:27,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-12-08 15:48:27,463 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-08 15:48:27,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,464 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 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#L26-3 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; 367#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 368#L26-3 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; 369#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 374#L26-3 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; 373#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 372#L26-3 assume !(main_~i~1 < 5); 366#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 352#L7-3 [2018-12-08 15:48:27,464 INFO L796 eck$LassoCheckResult]: Loop: 352#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 358#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 351#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 352#L7-3 [2018-12-08 15:48:27,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-08 15:48:27,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:27,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:27,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:27,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 15:48:27,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:27,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:27,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-08 15:48:27,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:27,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2018-12-08 15:48:27,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:48:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:48:27,587 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-08 15:48:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:27,601 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-08 15:48:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:48:27,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2018-12-08 15:48:27,601 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2018-12-08 15:48:27,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 15:48:27,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-12-08 15:48:27,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,602 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-08 15:48:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-12-08 15:48:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-08 15:48:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-08 15:48:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-08 15:48:27,604 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-08 15:48:27,604 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-08 15:48:27,604 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 15:48:27,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-12-08 15:48:27,604 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-08 15:48:27,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,605 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 451#L-1 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; 452#L26-3 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; 459#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 460#L26-3 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; 461#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 462#L26-3 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; 468#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 467#L26-3 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; 466#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 465#L26-3 assume !(main_~i~1 < 5); 458#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 444#L7-3 [2018-12-08 15:48:27,605 INFO L796 eck$LassoCheckResult]: Loop: 444#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 450#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 443#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 444#L7-3 [2018-12-08 15:48:27,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-08 15:48:27,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:27,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:48:27,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:48:27,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:27,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:27,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:27,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 15:48:27,680 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:27,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2018-12-08 15:48:27,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:48:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:48:27,729 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-12-08 15:48:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:27,741 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-08 15:48:27,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:48:27,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-12-08 15:48:27,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-12-08 15:48:27,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 15:48:27,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-08 15:48:27,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-12-08 15:48:27,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:27,743 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 15:48:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-12-08 15:48:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-08 15:48:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 15:48:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-08 15:48:27,744 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 15:48:27,744 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-08 15:48:27,744 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 15:48:27,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2018-12-08 15:48:27,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-12-08 15:48:27,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:27,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:27,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-08 15:48:27,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:27,745 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 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; 554#L26-3 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; 561#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 562#L26-3 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; 563#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 572#L26-3 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; 571#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 570#L26-3 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; 569#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 568#L26-3 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; 567#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 566#L26-3 assume !(main_~i~1 < 5); 560#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 546#L7-3 [2018-12-08 15:48:27,745 INFO L796 eck$LassoCheckResult]: Loop: 546#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 552#L9 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 545#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 546#L7-3 [2018-12-08 15:48:27,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-08 15:48:27,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2018-12-08 15:48:27,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2018-12-08 15:48:27,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,090 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-12-08 15:48:28,130 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 15:48:28,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 15:48:28,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 15:48:28,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 15:48:28,131 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 15:48:28,131 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 15:48:28,131 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 15:48:28,131 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 15:48:28,131 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-08 15:48:28,131 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 15:48:28,131 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 15:48:28,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:28,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 15:48:28,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 15:48:28,340 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-12-08 15:48:28,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,342 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-12-08 15:48:28,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,343 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-12-08 15:48:28,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,344 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-12-08 15:48:28,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,345 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-12-08 15:48:28,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,346 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-12-08 15:48:28,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:28,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:28,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,348 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-12-08 15:48:28,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,349 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-12-08 15:48:28,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,350 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-12-08 15:48:28,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:28,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:28,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,354 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-12-08 15:48:28,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,355 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-12-08 15:48:28,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,356 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-12-08 15:48:28,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,357 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-12-08 15:48:28,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,358 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-12-08 15:48:28,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:28,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:28,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,360 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-12-08 15:48:28,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,362 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-12-08 15:48:28,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,363 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-12-08 15:48:28,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,364 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-12-08 15:48:28,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,365 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-12-08 15:48:28,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,366 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-12-08 15:48:28,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,368 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-12-08 15:48:28,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:28,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:28,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:28,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:28,369 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-12-08 15:48:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:28,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:28,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:28,379 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 15:48:28,384 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 15:48:28,384 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 15:48:28,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 15:48:28,385 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 15:48:28,385 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 15:48:28,385 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~i~0) = -2*ULTIMATE.start_sep_~i~0 + 9 Supporting invariants [] [2018-12-08 15:48:28,390 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 15:48:28,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:28,423 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-12-08 15:48:28,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-08 15:48:28,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 46 transitions. Complement of second has 7 states. [2018-12-08 15:48:28,432 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-12-08 15:48:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 15:48:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 15:48:28,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 15:48:28,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:28,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 15:48:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:28,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 15:48:28,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:28,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2018-12-08 15:48:28,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 31 states and 39 transitions. [2018-12-08 15:48:28,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-08 15:48:28,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 15:48:28,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-12-08 15:48:28,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:28,436 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-08 15:48:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-12-08 15:48:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-08 15:48:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 15:48:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-08 15:48:28,437 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-08 15:48:28,437 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-08 15:48:28,437 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 15:48:28,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-12-08 15:48:28,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:28,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:28,438 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:28,438 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:28,438 INFO L794 eck$LassoCheckResult]: Stem: 709#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 705#L-1 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; 706#L26-3 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; 714#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 715#L26-3 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; 716#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 725#L26-3 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; 724#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 723#L26-3 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; 722#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 721#L26-3 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; 720#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 719#L26-3 assume !(main_~i~1 < 5); 712#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 713#L7-3 assume !(sep_~i~0 < 5); 717#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 718#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 707#L7-8 [2018-12-08 15:48:28,439 INFO L796 eck$LassoCheckResult]: Loop: 707#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 700#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 701#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 707#L7-8 [2018-12-08 15:48:28,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581187, now seen corresponding path program 1 times [2018-12-08 15:48:28,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 15:48:28,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:48:28,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 15:48:28,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:28,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash 74576, now seen corresponding path program 1 times [2018-12-08 15:48:28,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 15:48:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 15:48:28,492 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 15:48:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:28,503 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-12-08 15:48:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 15:48:28,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2018-12-08 15:48:28,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2018-12-08 15:48:28,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-08 15:48:28,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 15:48:28,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-12-08 15:48:28,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:28,505 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-12-08 15:48:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-12-08 15:48:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-12-08 15:48:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 15:48:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-08 15:48:28,506 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-08 15:48:28,506 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-08 15:48:28,506 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 15:48:28,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-12-08 15:48:28,506 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:28,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:28,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:28,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:28,507 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 781#L-1 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; 782#L26-3 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; 791#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 792#L26-3 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; 793#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 802#L26-3 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; 801#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 800#L26-3 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; 799#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 798#L26-3 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; 797#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 796#L26-3 assume !(main_~i~1 < 5); 789#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 790#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 780#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 774#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 775#L7-3 assume !(sep_~i~0 < 5); 794#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 795#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 783#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-12-08 15:48:28,507 INFO L796 eck$LassoCheckResult]: Loop: 776#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 777#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 786#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 776#L9-2 [2018-12-08 15:48:28,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1567455174, now seen corresponding path program 1 times [2018-12-08 15:48:28,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 15:48:28,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:28,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 15:48:28,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:28,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-08 15:48:28,570 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:28,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,570 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 2 times [2018-12-08 15:48:28,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:48:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:48:28,597 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-08 15:48:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:28,618 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2018-12-08 15:48:28,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:48:28,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2018-12-08 15:48:28,619 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 61 transitions. [2018-12-08 15:48:28,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 15:48:28,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 15:48:28,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2018-12-08 15:48:28,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:28,620 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-12-08 15:48:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2018-12-08 15:48:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-12-08 15:48:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-08 15:48:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-12-08 15:48:28,621 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-12-08 15:48:28,621 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-12-08 15:48:28,621 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 15:48:28,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2018-12-08 15:48:28,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:28,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:28,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:28,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:28,622 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 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; 933#L26-3 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; 940#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 941#L26-3 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; 942#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 956#L26-3 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; 955#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 954#L26-3 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; 953#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 952#L26-3 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; 951#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 950#L26-3 assume !(main_~i~1 < 5); 938#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 939#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 946#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 922#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 923#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 928#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 929#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 948#L7-3 assume !(sep_~i~0 < 5); 943#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 944#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 945#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 949#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 934#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 930#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-12-08 15:48:28,622 INFO L796 eck$LassoCheckResult]: Loop: 924#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 925#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 947#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 924#L9-2 [2018-12-08 15:48:28,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1248848095, now seen corresponding path program 1 times [2018-12-08 15:48:28,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:28,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 15:48:28,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:28,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 15:48:28,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:28,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-08 15:48:28,681 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:28,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 3 times [2018-12-08 15:48:28,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:48:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-08 15:48:28,713 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-12-08 15:48:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:28,749 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2018-12-08 15:48:28,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:48:28,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 73 transitions. [2018-12-08 15:48:28,750 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 73 transitions. [2018-12-08 15:48:28,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-08 15:48:28,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-08 15:48:28,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 73 transitions. [2018-12-08 15:48:28,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:28,750 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2018-12-08 15:48:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 73 transitions. [2018-12-08 15:48:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-12-08 15:48:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 15:48:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-12-08 15:48:28,752 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-08 15:48:28,752 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-08 15:48:28,752 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 15:48:28,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2018-12-08 15:48:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:28,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:28,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:28,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:28,753 INFO L794 eck$LassoCheckResult]: Stem: 1116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1112#L-1 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; 1113#L26-3 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; 1123#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1124#L26-3 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; 1125#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1138#L26-3 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; 1137#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1136#L26-3 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; 1135#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1134#L26-3 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; 1133#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1132#L26-3 assume !(main_~i~1 < 5); 1121#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1122#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1129#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1139#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1142#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1143#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1103#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1104#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1110#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1111#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1131#L7-3 assume !(sep_~i~0 < 5); 1126#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1127#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1128#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1144#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1117#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1118#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1140#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1141#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1114#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-12-08 15:48:28,753 INFO L796 eck$LassoCheckResult]: Loop: 1106#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1107#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1130#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1106#L9-2 [2018-12-08 15:48:28,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1685621030, now seen corresponding path program 2 times [2018-12-08 15:48:28,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 15:48:28,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:28,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:28,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 15:48:28,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:48:28,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:28,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 15:48:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-08 15:48:28,839 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:28,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 4 times [2018-12-08 15:48:28,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:48:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:48:28,872 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-08 15:48:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:28,912 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-12-08 15:48:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:48:28,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 85 transitions. [2018-12-08 15:48:28,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 85 transitions. [2018-12-08 15:48:28,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-08 15:48:28,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-08 15:48:28,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 85 transitions. [2018-12-08 15:48:28,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:28,915 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-12-08 15:48:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 85 transitions. [2018-12-08 15:48:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-12-08 15:48:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 15:48:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2018-12-08 15:48:28,917 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-08 15:48:28,917 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2018-12-08 15:48:28,917 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 15:48:28,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2018-12-08 15:48:28,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:28,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:28,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:28,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:28,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:28,919 INFO L794 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1329#L-1 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; 1330#L26-3 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; 1337#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1338#L26-3 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; 1339#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1357#L26-3 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; 1356#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1355#L26-3 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; 1354#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1353#L26-3 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; 1352#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1351#L26-3 assume !(main_~i~1 < 5); 1335#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1336#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1343#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1366#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1344#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1326#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1319#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1320#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1365#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1364#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1363#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1349#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1350#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1348#L7-3 assume !(sep_~i~0 < 5); 1340#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1341#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1342#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1362#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1331#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1327#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1322#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1323#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1361#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1360#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1359#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1358#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-12-08 15:48:28,919 INFO L796 eck$LassoCheckResult]: Loop: 1346#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1347#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1345#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1346#L9-2 [2018-12-08 15:48:28,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash -534676351, now seen corresponding path program 3 times [2018-12-08 15:48:28,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:28,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-08 15:48:28,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:48:28,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d40a630-40e3-4533-b457-b777b6379d28/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-12-08 15:48:28,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:48:29,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-08 15:48:29,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:48:29,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-08 15:48:29,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:48:29,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 15:48:29,028 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 15:48:29,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 5 times [2018-12-08 15:48:29,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:48:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:48:29,066 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 15:48:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:29,103 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2018-12-08 15:48:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:48:29,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 88 transitions. [2018-12-08 15:48:29,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:29,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 88 transitions. [2018-12-08 15:48:29,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-08 15:48:29,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-12-08 15:48:29,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2018-12-08 15:48:29,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:29,105 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-12-08 15:48:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2018-12-08 15:48:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-12-08 15:48:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 15:48:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-12-08 15:48:29,107 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-12-08 15:48:29,107 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-12-08 15:48:29,107 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 15:48:29,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2018-12-08 15:48:29,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-12-08 15:48:29,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:29,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:29,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:29,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 15:48:29,109 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1573#L-1 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; 1574#L26-3 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; 1581#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1582#L26-3 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; 1583#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1616#L26-3 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; 1615#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1614#L26-3 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; 1612#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1611#L26-3 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; 1609#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1608#L26-3 assume !(main_~i~1 < 5); 1579#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1580#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1587#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1610#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1588#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1570#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1564#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1565#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1607#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1606#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1605#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1603#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1601#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1599#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1594#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1596#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1593#L7-3 assume !(sep_~i~0 < 5); 1584#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1585#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1586#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1613#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1575#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1571#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1566#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1567#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1604#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1602#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1600#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1598#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1597#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1595#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1592#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-12-08 15:48:29,109 INFO L796 eck$LassoCheckResult]: Loop: 1590#L9-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1591#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1589#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1590#L9-2 [2018-12-08 15:48:29,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1616244090, now seen corresponding path program 4 times [2018-12-08 15:48:29,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash 77576, now seen corresponding path program 6 times [2018-12-08 15:48:29,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1350622481, now seen corresponding path program 1 times [2018-12-08 15:48:29,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:48:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-08 15:48:29,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:48:29,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 15:48:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 15:48:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:48:29,303 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-12-08 15:48:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:48:29,400 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-12-08 15:48:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:48:29,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-12-08 15:48:29,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 15:48:29,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 63 transitions. [2018-12-08 15:48:29,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-08 15:48:29,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-08 15:48:29,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-12-08 15:48:29,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:29,402 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-12-08 15:48:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-12-08 15:48:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-08 15:48:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-08 15:48:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-12-08 15:48:29,405 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-12-08 15:48:29,405 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-12-08 15:48:29,405 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-08 15:48:29,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 63 transitions. [2018-12-08 15:48:29,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 15:48:29,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 15:48:29,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 15:48:29,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:48:29,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 15:48:29,407 INFO L794 eck$LassoCheckResult]: Stem: 1726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1721#L-1 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; 1722#L26-3 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; 1729#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1730#L26-3 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; 1731#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1764#L26-3 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; 1763#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1762#L26-3 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; 1761#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1760#L26-3 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; 1759#L26-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1758#L26-3 assume !(main_~i~1 < 5); 1727#L26-4 sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1728#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1719#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1713#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1714#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1757#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1755#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1753#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1751#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1749#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1747#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1745#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1743#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1741#L7-3 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1739#L9 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1737#L7-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1735#L7-3 assume !(sep_~i~0 < 5); 1732#L7-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1733#L14 main_#t~ret6 := sep_#res;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);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1720#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1715#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1716#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1723#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1756#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1754#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1752#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1750#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1748#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1746#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1744#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1742#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1740#L7-8 assume !!(sep_~i~0 < 5);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1738#L9-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1736#L7-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1734#L7-8 assume !(sep_~i~0 < 5); 1717#L7-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1718#L14-1 main_#t~ret9 := sep_#res;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; 1724#L35-3 [2018-12-08 15:48:29,407 INFO L796 eck$LassoCheckResult]: Loop: 1724#L35-3 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; 1725#L35-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1724#L35-3 [2018-12-08 15:48:29,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash -866233935, now seen corresponding path program 1 times [2018-12-08 15:48:29,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2018-12-08 15:48:29,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash 772846003, now seen corresponding path program 1 times [2018-12-08 15:48:29,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 15:48:29,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 15:48:29,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:48:29,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:48:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 15:48:33,269 WARN L180 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 431 DAG size of output: 308 [2018-12-08 15:48:33,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 15:48:44,649 WARN L180 SmtUtils]: Spent 7.51 s on a formula simplification. DAG size of input: 635 DAG size of output: 125 [2018-12-08 15:48:44,651 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 15:48:44,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 15:48:44,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 15:48:44,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 15:48:44,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 15:48:44,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 15:48:44,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 15:48:44,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 15:48:44,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: sep05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-12-08 15:48:44,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 15:48:44,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 15:48:44,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:44,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 15:48:45,198 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 15:48:45,198 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 15:48:45,198 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-12-08 15:48:45,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,200 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-12-08 15:48:45,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,202 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-12-08 15:48:45,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,203 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-12-08 15:48:45,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,205 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-12-08 15:48:45,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,207 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-12-08 15:48:45,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,208 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-12-08 15:48:45,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,210 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-12-08 15:48:45,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,214 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-12-08 15:48:45,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,216 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-12-08 15:48:45,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,219 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-12-08 15:48:45,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,220 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-12-08 15:48:45,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,222 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-12-08 15:48:45,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,224 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-12-08 15:48:45,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,227 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-12-08 15:48:45,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,228 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-12-08 15:48:45,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,230 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-12-08 15:48:45,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,231 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-12-08 15:48:45,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,233 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-12-08 15:48:45,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,236 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-12-08 15:48:45,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,240 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-12-08 15:48:45,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,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-12-08 15:48:45,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,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-12-08 15:48:45,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,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-12-08 15:48:45,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,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-12-08 15:48:45,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 15:48:45,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 15:48:45,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 15:48:45,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,252 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-12-08 15:48:45,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 15:48:45,255 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-12-08 15:48:45,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 15:48:45,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 15:48:45,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 15:48:45,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 15:48:45,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 15:48:45,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 15:48:45,263 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 15:48:45,280 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 15:48:45,280 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 15:48:45,280 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 15:48:45,281 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 15:48:45,281 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 15:48:45,281 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-12-08 15:48:45,351 INFO L297 tatePredicateManager]: 27 out of 27 supporting invariants were superfluous and have been removed [2018-12-08 15:48:45,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 15:48:45,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:48:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:45,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:48:45,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:48:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:48:45,396 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-12-08 15:48:45,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-08 15:48:45,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 63 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 54 states and 66 transitions. Complement of second has 4 states. [2018-12-08 15:48:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 15:48:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 15:48:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-08 15:48:45,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 2 letters. [2018-12-08 15:48:45,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:45,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 52 letters. Loop has 2 letters. [2018-12-08 15:48:45,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:45,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 50 letters. Loop has 4 letters. [2018-12-08 15:48:45,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 15:48:45,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 66 transitions. [2018-12-08 15:48:45,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 15:48:45,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 15:48:45,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 15:48:45,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 15:48:45,405 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-08 15:48:45,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:48:45,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 15:48:45,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 15:48:45,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 03:48:45 BoogieIcfgContainer [2018-12-08 15:48:45,410 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 15:48:45,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 15:48:45,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 15:48:45,410 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 15:48:45,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:48:26" (3/4) ... [2018-12-08 15:48:45,413 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 15:48:45,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 15:48:45,414 INFO L168 Benchmark]: Toolchain (without parser) took 19382.50 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 736.1 MB). Free memory was 960.3 MB in the beginning and 1.6 GB in the end (delta: -608.4 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,414 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:45,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,415 INFO L168 Benchmark]: Boogie Preprocessor took 49.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,416 INFO L168 Benchmark]: RCFGBuilder took 179.34 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,416 INFO L168 Benchmark]: BuchiAutomizer took 18974.88 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 616.0 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -478.1 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. [2018-12-08 15:48:45,417 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:48:45,419 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.89 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 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 31.26 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 944.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.34 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18974.88 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 616.0 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -478.1 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.8 GB. Free memory is still 1.6 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 -8 * i + 9 * unknown-#length-unknown[x] 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 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.9s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 18.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 329 SDtfs, 341 SDslu, 668 SDs, 0 SdLazy, 321 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital245 mio100 ax100 hnf99 lsp92 ukn50 mio100 lsp57 div100 bol100 ite100 ukn100 eq167 hnf87 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms 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...