./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/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 8d15e59fd1b84d7219285b33cc166f567d0bcf3e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:24:16,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:24:16,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:24:16,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:24:16,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:24:16,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:24:16,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:24:16,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:24:16,226 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:24:16,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:24:16,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:24:16,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:24:16,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:24:16,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:24:16,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:24:16,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:24:16,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:24:16,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:24:16,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:24:16,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:24:16,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:24:16,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:24:16,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:24:16,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:24:16,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:24:16,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:24:16,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:24:16,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:24:16,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:24:16,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:24:16,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:24:16,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:24:16,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:24:16,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:24:16,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:24:16,243 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:24:16,244 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:24:16,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:24:16,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:24:16,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:24:16,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:24:16,256 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:24:16,256 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:24:16,256 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:24:16,256 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:24:16,256 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:24:16,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:24:16,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:24:16,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:24:16,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:24:16,259 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:24:16,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:24:16,259 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:24:16,259 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:24:16,260 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:24:16,260 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_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/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 -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2018-11-10 12:24:16,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:24:16,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:24:16,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:24:16,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:24:16,293 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:24:16,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-10 12:24:16,328 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/data/f3fd5daca/cf62c407212d4a76bd1b7e3f8a490fec/FLAG394d23120 [2018-11-10 12:24:16,728 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:24:16,729 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-10 12:24:16,733 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/data/f3fd5daca/cf62c407212d4a76bd1b7e3f8a490fec/FLAG394d23120 [2018-11-10 12:24:16,743 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/data/f3fd5daca/cf62c407212d4a76bd1b7e3f8a490fec [2018-11-10 12:24:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:24:16,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:24:16,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:24:16,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:24:16,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:24:16,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc8502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16, skipping insertion in model container [2018-11-10 12:24:16,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:24:16,770 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:24:16,877 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:24:16,884 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:24:16,900 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:24:16,910 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:24:16,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16 WrapperNode [2018-11-10 12:24:16,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:24:16,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:24:16,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:24:16,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:24:16,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:24:16,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:24:16,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:24:16,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:24:16,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:16,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:17,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... [2018-11-10 12:24:17,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:24:17,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:24:17,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:24:17,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:24:17,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:24:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:24:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:24:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:24:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:24:17,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:24:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:24:17,280 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:24:17,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:24:17 BoogieIcfgContainer [2018-11-10 12:24:17,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:24:17,281 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:24:17,281 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:24:17,286 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:24:17,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:24:17,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:24:16" (1/3) ... [2018-11-10 12:24:17,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22b20247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:24:17, skipping insertion in model container [2018-11-10 12:24:17,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:24:17,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:16" (2/3) ... [2018-11-10 12:24:17,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22b20247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:24:17, skipping insertion in model container [2018-11-10 12:24:17,289 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:24:17,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:24:17" (3/3) ... [2018-11-10 12:24:17,291 INFO L375 chiAutomizerObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-11-10 12:24:17,340 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:24:17,341 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:24:17,341 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:24:17,341 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:24:17,341 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:24:17,341 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:24:17,341 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:24:17,341 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:24:17,341 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:24:17,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-10 12:24:17,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 12:24:17,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:17,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:17,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:24:17,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:17,377 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:24:17,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-10 12:24:17,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 12:24:17,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:17,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:17,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:24:17,380 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:17,385 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 36#L28-4true [2018-11-10 12:24:17,385 INFO L795 eck$LassoCheckResult]: Loop: 36#L28-4true assume true; 22#L28-1true assume !!(main_~j~0 < 10); 8#L29true SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 6#L29-1true havoc main_#t~nondet6; 27#L30true SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 26#L30-1true havoc main_#t~nondet7.base, main_#t~nondet7.offset; 40#L28-3true main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 36#L28-4true [2018-11-10 12:24:17,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:24:17,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1195698039, now seen corresponding path program 1 times [2018-11-10 12:24:17,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash 350598791, now seen corresponding path program 1 times [2018-11-10 12:24:17,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:17,794 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:24:17,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:24:17,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:24:17,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:24:17,796 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:24:17,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:24:17,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:24:17,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:24:17,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: test27_false-unreach-call_true-termination.c_Iteration1_Lasso [2018-11-10 12:24:17,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:24:17,797 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:24:17,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:17,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:24:18,365 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:24:18,370 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:24:18,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,451 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:24:18,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,452 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:24:18,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,458 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:24:18,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,459 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:24:18,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,528 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:24:18,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:24:18,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:24:18,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:24:18,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:24:18,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:24:18,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:24:18,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:24:18,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:24:18,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:24:18,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:24:18,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:24:18,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:24:18,591 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:24:18,634 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 12:24:18,634 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 12:24:18,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:24:18,638 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:24:18,638 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:24:18,639 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2018-11-10 12:24:18,688 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 12:24:18,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:18,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:18,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:18,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:24:18,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states. Second operand 4 states. [2018-11-10 12:24:18,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states.. Second operand 4 states. Result 109 states and 124 transitions. Complement of second has 7 states. [2018-11-10 12:24:18,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:24:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:24:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-10 12:24:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 12:24:18,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:24:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 12:24:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:24:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 81 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 12:24:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:24:18,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 124 transitions. [2018-11-10 12:24:18,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:18,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 29 states and 31 transitions. [2018-11-10 12:24:18,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 12:24:18,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:18,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2018-11-10 12:24:18,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:18,825 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 12:24:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2018-11-10 12:24:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 12:24:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 12:24:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 12:24:18,843 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 12:24:18,843 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 12:24:18,843 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:24:18,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-10 12:24:18,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:18,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:18,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:18,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:18,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:18,845 INFO L793 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 273#L28-4 assume true; 281#L28-1 assume !(main_~j~0 < 10); 282#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 289#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 288#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 274#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 275#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 276#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 277#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 278#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 291#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 265#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 263#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 264#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 284#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 279#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 280#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 267#L40-4 [2018-11-10 12:24:18,846 INFO L795 eck$LassoCheckResult]: Loop: 267#L40-4 assume true; 270#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 266#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 267#L40-4 [2018-11-10 12:24:18,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1711345702, now seen corresponding path program 1 times [2018-11-10 12:24:18,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:18,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:18,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:24:18,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:24:18,895 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 1 times [2018-11-10 12:24:18,896 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:24:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:24:18,957 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 12:24:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:18,975 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-10 12:24:18,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:24:18,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2018-11-10 12:24:18,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:18,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 36 transitions. [2018-11-10 12:24:18,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:18,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:18,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 36 transitions. [2018-11-10 12:24:18,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:18,980 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-10 12:24:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 36 transitions. [2018-11-10 12:24:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-10 12:24:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 12:24:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-10 12:24:18,981 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 12:24:18,982 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 12:24:18,982 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:24:18,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2018-11-10 12:24:18,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:18,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:18,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:18,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:18,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:18,986 INFO L793 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 344#L28-4 assume true; 354#L28-1 assume !!(main_~j~0 < 10); 342#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 339#L29-1 havoc main_#t~nondet6; 340#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 356#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 357#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 361#L28-4 assume true; 352#L28-1 assume !(main_~j~0 < 10); 353#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 360#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 359#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 345#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 346#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 347#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 348#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 349#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 362#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 336#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 334#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 335#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 355#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 350#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 351#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 338#L40-4 [2018-11-10 12:24:18,986 INFO L795 eck$LassoCheckResult]: Loop: 338#L40-4 assume true; 341#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 337#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 338#L40-4 [2018-11-10 12:24:18,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 983866774, now seen corresponding path program 1 times [2018-11-10 12:24:18,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:19,024 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:19,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:19,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:19,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 12:24:19,113 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:19,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 2 times [2018-11-10 12:24:19,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:24:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:24:19,131 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 12:24:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:19,146 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-10 12:24:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:24:19,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 44 transitions. [2018-11-10 12:24:19,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 43 transitions. [2018-11-10 12:24:19,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:19,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:19,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2018-11-10 12:24:19,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:19,148 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-10 12:24:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2018-11-10 12:24:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-10 12:24:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:24:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-10 12:24:19,149 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 12:24:19,149 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-10 12:24:19,150 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:24:19,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-10 12:24:19,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:19,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:19,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:19,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:19,153 INFO L793 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 499#L28-4 assume true; 516#L28-1 assume !!(main_~j~0 < 10); 524#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 523#L29-1 havoc main_#t~nondet6; 522#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 521#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 519#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 517#L28-4 assume true; 509#L28-1 assume !!(main_~j~0 < 10); 497#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 494#L29-1 havoc main_#t~nondet6; 495#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 511#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 512#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 520#L28-4 assume true; 507#L28-1 assume !(main_~j~0 < 10); 508#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 515#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 513#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 500#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 501#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 502#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 503#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 504#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 518#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 491#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 489#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 490#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 510#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 505#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 506#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 493#L40-4 [2018-11-10 12:24:19,153 INFO L795 eck$LassoCheckResult]: Loop: 493#L40-4 assume true; 496#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 492#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 493#L40-4 [2018-11-10 12:24:19,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash -82885542, now seen corresponding path program 2 times [2018-11-10 12:24:19,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:19,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:19,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:24:19,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:24:19,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:19,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:19,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 12:24:19,281 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:19,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 3 times [2018-11-10 12:24:19,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:19,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:24:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:24:19,323 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 12:24:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:19,355 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-10 12:24:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:24:19,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2018-11-10 12:24:19,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 49 states and 50 transitions. [2018-11-10 12:24:19,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:19,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:19,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2018-11-10 12:24:19,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:19,358 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-10 12:24:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2018-11-10 12:24:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-10 12:24:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 12:24:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-10 12:24:19,363 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-10 12:24:19,363 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-10 12:24:19,363 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:24:19,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 44 transitions. [2018-11-10 12:24:19,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:19,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:19,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:19,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:19,367 INFO L793 eck$LassoCheckResult]: Stem: 705#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 689#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 690#L28-4 assume true; 707#L28-1 assume !!(main_~j~0 < 10); 722#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 721#L29-1 havoc main_#t~nondet6; 720#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 719#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 718#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 708#L28-4 assume true; 700#L28-1 assume !!(main_~j~0 < 10); 688#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 685#L29-1 havoc main_#t~nondet6; 686#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 702#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 703#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 710#L28-4 assume true; 712#L28-1 assume !!(main_~j~0 < 10); 717#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 716#L29-1 havoc main_#t~nondet6; 715#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 714#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 713#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 711#L28-4 assume true; 698#L28-1 assume !(main_~j~0 < 10); 699#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 706#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 704#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 691#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 692#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 693#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 694#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 695#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 709#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 682#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 680#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 681#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 701#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 696#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 697#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 684#L40-4 [2018-11-10 12:24:19,367 INFO L795 eck$LassoCheckResult]: Loop: 684#L40-4 assume true; 687#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 683#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 684#L40-4 [2018-11-10 12:24:19,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1524906262, now seen corresponding path program 3 times [2018-11-10 12:24:19,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:19,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:19,436 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:24:19,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 12:24:19,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:19,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:19,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 12:24:19,557 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:19,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 4 times [2018-11-10 12:24:19,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:24:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:24:19,595 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-10 12:24:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:19,619 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-10 12:24:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:24:19,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 58 transitions. [2018-11-10 12:24:19,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 57 transitions. [2018-11-10 12:24:19,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:19,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:19,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 57 transitions. [2018-11-10 12:24:19,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:19,621 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-10 12:24:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 57 transitions. [2018-11-10 12:24:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-11-10 12:24:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 12:24:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-10 12:24:19,624 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-10 12:24:19,624 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-10 12:24:19,624 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:24:19,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2018-11-10 12:24:19,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:19,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:19,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:19,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:19,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:19,626 INFO L793 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 916#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 917#L28-4 assume true; 927#L28-1 assume !!(main_~j~0 < 10); 915#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 912#L29-1 havoc main_#t~nondet6; 913#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 931#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 953#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 935#L28-4 assume true; 936#L28-1 assume !!(main_~j~0 < 10); 956#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 955#L29-1 havoc main_#t~nondet6; 954#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 929#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 930#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 938#L28-4 assume true; 952#L28-1 assume !!(main_~j~0 < 10); 951#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 950#L29-1 havoc main_#t~nondet6; 949#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 948#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 947#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 946#L28-4 assume true; 940#L28-1 assume !!(main_~j~0 < 10); 945#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 944#L29-1 havoc main_#t~nondet6; 943#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 942#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 941#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 939#L28-4 assume true; 925#L28-1 assume !(main_~j~0 < 10); 926#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 934#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 933#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 918#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 919#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 920#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 921#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 924#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 937#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 909#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 907#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 908#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 928#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 922#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 923#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 911#L40-4 [2018-11-10 12:24:19,626 INFO L795 eck$LassoCheckResult]: Loop: 911#L40-4 assume true; 914#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 910#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 911#L40-4 [2018-11-10 12:24:19,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 749844698, now seen corresponding path program 4 times [2018-11-10 12:24:19,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:19,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:19,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:19,675 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:19,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:24:20,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:24:20,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:20,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:20,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:20,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 12:24:20,234 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:20,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 5 times [2018-11-10 12:24:20,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:20,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:20,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:20,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:24:20,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:24:20,271 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 12:24:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:20,297 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-10 12:24:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:24:20,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 65 transitions. [2018-11-10 12:24:20,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:20,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 64 transitions. [2018-11-10 12:24:20,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:20,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:20,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 64 transitions. [2018-11-10 12:24:20,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:20,299 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-10 12:24:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 64 transitions. [2018-11-10 12:24:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-11-10 12:24:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 12:24:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 12:24:20,302 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 12:24:20,302 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 12:24:20,302 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:24:20,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 58 transitions. [2018-11-10 12:24:20,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:20,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:20,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:20,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:20,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:20,303 INFO L793 eck$LassoCheckResult]: Stem: 1196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 1180#L28-4 assume true; 1190#L28-1 assume !!(main_~j~0 < 10); 1178#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1175#L29-1 havoc main_#t~nondet6; 1176#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1194#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1223#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1198#L28-4 assume true; 1199#L28-1 assume !!(main_~j~0 < 10); 1226#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1225#L29-1 havoc main_#t~nondet6; 1224#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1192#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1193#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1201#L28-4 assume true; 1222#L28-1 assume !!(main_~j~0 < 10); 1221#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1220#L29-1 havoc main_#t~nondet6; 1219#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1218#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1217#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1216#L28-4 assume true; 1215#L28-1 assume !!(main_~j~0 < 10); 1214#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1213#L29-1 havoc main_#t~nondet6; 1212#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1211#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1210#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1209#L28-4 assume true; 1203#L28-1 assume !!(main_~j~0 < 10); 1208#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1207#L29-1 havoc main_#t~nondet6; 1206#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1205#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1204#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1202#L28-4 assume true; 1188#L28-1 assume !(main_~j~0 < 10); 1189#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1197#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 1195#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 1181#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 1182#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 1183#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 1184#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 1185#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 1200#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 1172#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 1170#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 1171#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 1191#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 1186#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 1187#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 1174#L40-4 [2018-11-10 12:24:20,304 INFO L795 eck$LassoCheckResult]: Loop: 1174#L40-4 assume true; 1177#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 1173#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 1174#L40-4 [2018-11-10 12:24:20,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1743631510, now seen corresponding path program 5 times [2018-11-10 12:24:20,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:20,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:20,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:20,364 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:20,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:24:20,567 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 12:24:20,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:20,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:24:20,610 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:20,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 6 times [2018-11-10 12:24:20,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:20,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:24:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:24:20,628 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 12:24:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:20,658 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-10 12:24:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:24:20,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 72 transitions. [2018-11-10 12:24:20,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:20,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 70 states and 71 transitions. [2018-11-10 12:24:20,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:20,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 71 transitions. [2018-11-10 12:24:20,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:20,661 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-10 12:24:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 71 transitions. [2018-11-10 12:24:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-11-10 12:24:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:24:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-10 12:24:20,663 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 12:24:20,663 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 12:24:20,664 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:24:20,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 65 transitions. [2018-11-10 12:24:20,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:20,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:20,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:20,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:20,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:20,668 INFO L793 eck$LassoCheckResult]: Stem: 1495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 1479#L28-4 assume true; 1489#L28-1 assume !!(main_~j~0 < 10); 1477#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1474#L29-1 havoc main_#t~nondet6; 1475#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1493#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1529#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1497#L28-4 assume true; 1498#L28-1 assume !!(main_~j~0 < 10); 1532#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1531#L29-1 havoc main_#t~nondet6; 1530#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1491#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1492#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1500#L28-4 assume true; 1528#L28-1 assume !!(main_~j~0 < 10); 1527#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1526#L29-1 havoc main_#t~nondet6; 1525#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1524#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1523#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1522#L28-4 assume true; 1521#L28-1 assume !!(main_~j~0 < 10); 1520#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1519#L29-1 havoc main_#t~nondet6; 1518#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1517#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1516#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1515#L28-4 assume true; 1514#L28-1 assume !!(main_~j~0 < 10); 1513#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1512#L29-1 havoc main_#t~nondet6; 1511#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1510#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1509#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1508#L28-4 assume true; 1502#L28-1 assume !!(main_~j~0 < 10); 1507#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1506#L29-1 havoc main_#t~nondet6; 1505#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1504#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1503#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1501#L28-4 assume true; 1487#L28-1 assume !(main_~j~0 < 10); 1488#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1496#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 1494#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 1480#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 1481#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 1482#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 1483#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 1484#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 1499#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 1471#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 1469#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 1470#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 1490#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 1485#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 1486#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 1473#L40-4 [2018-11-10 12:24:20,668 INFO L795 eck$LassoCheckResult]: Loop: 1473#L40-4 assume true; 1476#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 1472#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 1473#L40-4 [2018-11-10 12:24:20,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 883838298, now seen corresponding path program 6 times [2018-11-10 12:24:20,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:20,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:20,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:20,767 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:20,776 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 12:24:21,127 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 12:24:21,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:21,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 12:24:21,158 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:21,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 7 times [2018-11-10 12:24:21,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:21,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:24:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:24:21,214 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 12:24:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:21,257 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-10 12:24:21,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:24:21,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 79 transitions. [2018-11-10 12:24:21,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 78 transitions. [2018-11-10 12:24:21,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:21,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:21,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 78 transitions. [2018-11-10 12:24:21,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:21,260 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-10 12:24:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 78 transitions. [2018-11-10 12:24:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-11-10 12:24:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 12:24:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-11-10 12:24:21,263 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-10 12:24:21,263 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-10 12:24:21,263 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:24:21,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 72 transitions. [2018-11-10 12:24:21,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:21,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:21,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:21,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:21,265 INFO L793 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1813#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 1814#L28-4 assume true; 1824#L28-1 assume !!(main_~j~0 < 10); 1812#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1809#L29-1 havoc main_#t~nondet6; 1810#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1828#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1871#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1832#L28-4 assume true; 1833#L28-1 assume !!(main_~j~0 < 10); 1874#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1873#L29-1 havoc main_#t~nondet6; 1872#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1826#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1827#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1835#L28-4 assume true; 1870#L28-1 assume !!(main_~j~0 < 10); 1869#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1868#L29-1 havoc main_#t~nondet6; 1867#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1866#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1865#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1864#L28-4 assume true; 1863#L28-1 assume !!(main_~j~0 < 10); 1862#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1861#L29-1 havoc main_#t~nondet6; 1860#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1859#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1858#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1857#L28-4 assume true; 1856#L28-1 assume !!(main_~j~0 < 10); 1855#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1854#L29-1 havoc main_#t~nondet6; 1853#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1852#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1851#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1850#L28-4 assume true; 1849#L28-1 assume !!(main_~j~0 < 10); 1848#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1847#L29-1 havoc main_#t~nondet6; 1846#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1845#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1844#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1843#L28-4 assume true; 1837#L28-1 assume !!(main_~j~0 < 10); 1842#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 1841#L29-1 havoc main_#t~nondet6; 1840#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 1839#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 1838#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 1836#L28-4 assume true; 1822#L28-1 assume !(main_~j~0 < 10); 1823#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 1831#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 1830#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 1815#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 1816#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 1817#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 1818#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 1819#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 1834#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 1806#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 1804#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 1805#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 1825#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 1820#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 1821#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 1808#L40-4 [2018-11-10 12:24:21,265 INFO L795 eck$LassoCheckResult]: Loop: 1808#L40-4 assume true; 1811#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 1807#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 1808#L40-4 [2018-11-10 12:24:21,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash -889647082, now seen corresponding path program 7 times [2018-11-10 12:24:21,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:21,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:21,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:21,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 12:24:21,405 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:21,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,405 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 8 times [2018-11-10 12:24:21,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:24:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:24:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:24:21,424 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-10 12:24:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:21,463 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-11-10 12:24:21,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:24:21,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 86 transitions. [2018-11-10 12:24:21,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 84 states and 85 transitions. [2018-11-10 12:24:21,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:21,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:21,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 85 transitions. [2018-11-10 12:24:21,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:21,466 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-10 12:24:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 85 transitions. [2018-11-10 12:24:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2018-11-10 12:24:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 12:24:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-10 12:24:21,469 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-10 12:24:21,469 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-10 12:24:21,469 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:24:21,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 79 transitions. [2018-11-10 12:24:21,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:21,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:21,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:21,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:21,471 INFO L793 eck$LassoCheckResult]: Stem: 2200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 2185#L28-4 assume true; 2195#L28-1 assume !!(main_~j~0 < 10); 2183#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2180#L29-1 havoc main_#t~nondet6; 2181#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2199#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2249#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2203#L28-4 assume true; 2204#L28-1 assume !!(main_~j~0 < 10); 2252#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2251#L29-1 havoc main_#t~nondet6; 2250#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2197#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2198#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2206#L28-4 assume true; 2248#L28-1 assume !!(main_~j~0 < 10); 2247#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2246#L29-1 havoc main_#t~nondet6; 2245#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2244#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2243#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2242#L28-4 assume true; 2241#L28-1 assume !!(main_~j~0 < 10); 2240#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2239#L29-1 havoc main_#t~nondet6; 2238#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2237#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2236#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2235#L28-4 assume true; 2234#L28-1 assume !!(main_~j~0 < 10); 2233#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2232#L29-1 havoc main_#t~nondet6; 2231#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2230#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2229#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2228#L28-4 assume true; 2227#L28-1 assume !!(main_~j~0 < 10); 2226#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2225#L29-1 havoc main_#t~nondet6; 2224#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2223#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2222#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2221#L28-4 assume true; 2220#L28-1 assume !!(main_~j~0 < 10); 2219#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2218#L29-1 havoc main_#t~nondet6; 2217#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2216#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2215#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2214#L28-4 assume true; 2208#L28-1 assume !!(main_~j~0 < 10); 2213#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2212#L29-1 havoc main_#t~nondet6; 2211#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2210#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2209#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2207#L28-4 assume true; 2193#L28-1 assume !(main_~j~0 < 10); 2194#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 2202#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 2201#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 2186#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 2187#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 2188#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 2189#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 2190#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 2205#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 2177#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 2175#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 2176#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 2196#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 2191#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 2192#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 2179#L40-4 [2018-11-10 12:24:21,471 INFO L795 eck$LassoCheckResult]: Loop: 2179#L40-4 assume true; 2182#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 2178#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 2179#L40-4 [2018-11-10 12:24:21,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1523384794, now seen corresponding path program 8 times [2018-11-10 12:24:21,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:21,545 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:21,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:24:21,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:24:21,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:21,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:21,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 12:24:21,618 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:21,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 9 times [2018-11-10 12:24:21,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:21,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:24:21,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:24:21,638 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 12:24:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:21,679 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-11-10 12:24:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:24:21,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 93 transitions. [2018-11-10 12:24:21,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 91 states and 92 transitions. [2018-11-10 12:24:21,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:21,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:21,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 92 transitions. [2018-11-10 12:24:21,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:21,681 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-11-10 12:24:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 92 transitions. [2018-11-10 12:24:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-11-10 12:24:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 12:24:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-11-10 12:24:21,684 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-10 12:24:21,684 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-10 12:24:21,685 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:24:21,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 86 transitions. [2018-11-10 12:24:21,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:21,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:21,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:21,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:21,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:21,686 INFO L793 eck$LassoCheckResult]: Stem: 2608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2591#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 2592#L28-4 assume true; 2602#L28-1 assume !!(main_~j~0 < 10); 2590#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2587#L29-1 havoc main_#t~nondet6; 2588#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2606#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2663#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2610#L28-4 assume true; 2611#L28-1 assume !!(main_~j~0 < 10); 2666#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2665#L29-1 havoc main_#t~nondet6; 2664#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2604#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2605#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2613#L28-4 assume true; 2662#L28-1 assume !!(main_~j~0 < 10); 2661#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2660#L29-1 havoc main_#t~nondet6; 2659#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2658#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2657#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2656#L28-4 assume true; 2655#L28-1 assume !!(main_~j~0 < 10); 2654#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2653#L29-1 havoc main_#t~nondet6; 2652#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2651#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2650#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2649#L28-4 assume true; 2648#L28-1 assume !!(main_~j~0 < 10); 2647#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2646#L29-1 havoc main_#t~nondet6; 2645#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2644#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2643#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2642#L28-4 assume true; 2641#L28-1 assume !!(main_~j~0 < 10); 2640#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2639#L29-1 havoc main_#t~nondet6; 2638#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2637#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2636#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2635#L28-4 assume true; 2634#L28-1 assume !!(main_~j~0 < 10); 2633#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2632#L29-1 havoc main_#t~nondet6; 2631#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2630#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2629#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2628#L28-4 assume true; 2627#L28-1 assume !!(main_~j~0 < 10); 2626#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2625#L29-1 havoc main_#t~nondet6; 2624#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2623#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2622#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2621#L28-4 assume true; 2615#L28-1 assume !!(main_~j~0 < 10); 2620#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 2619#L29-1 havoc main_#t~nondet6; 2618#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 2617#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 2616#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 2614#L28-4 assume true; 2600#L28-1 assume !(main_~j~0 < 10); 2601#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 2609#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 2607#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 2593#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 2594#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 2595#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 2596#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 2597#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 2612#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 2584#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 2582#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 2583#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 2603#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 2598#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 2599#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 2586#L40-4 [2018-11-10 12:24:21,687 INFO L795 eck$LassoCheckResult]: Loop: 2586#L40-4 assume true; 2589#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 2585#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 2586#L40-4 [2018-11-10 12:24:21,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1799244694, now seen corresponding path program 9 times [2018-11-10 12:24:21,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:21,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:24:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:21,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:24:21,786 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9687b88-9e2b-4b31-b58b-8488a3b39d6b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:24:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:24:24,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 12:24:24,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:24:24,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:24:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:24:24,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:24:24,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 12:24:24,689 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:24:24,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 10 times [2018-11-10 12:24:24,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:24:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:24:24,711 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-10 12:24:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:24:24,760 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-11-10 12:24:24,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:24:24,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2018-11-10 12:24:24,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:24,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 93 states and 94 transitions. [2018-11-10 12:24:24,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:24:24,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:24:24,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 94 transitions. [2018-11-10 12:24:24,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:24:24,763 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-11-10 12:24:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 94 transitions. [2018-11-10 12:24:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-10 12:24:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 12:24:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-10 12:24:24,766 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-10 12:24:24,766 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-10 12:24:24,766 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:24:24,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 93 transitions. [2018-11-10 12:24:24,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:24:24,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:24:24,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:24:24,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:24:24,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:24:24,768 INFO L793 eck$LassoCheckResult]: Stem: 3045#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3029#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet4, main_#t~nondet6, main_#t~nondet7.base, main_#t~nondet7.offset, main_#t~post5, main_~j~0, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem11, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~pre16, main_#t~mem15, main_#t~ret17, main_~#cont~0.base, main_~#cont~0.offset, main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset, main_~#a~0.base, main_~#a~0.offset, main_~i~0, main_~pa~0.base, main_~pa~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#cont~0.base, main_~#cont~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummy~0.base, main_~#dummy~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#dummies~0.base, main_~#dummies~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~i~0;havoc main_~pa~0.base, main_~pa~0.offset;main_~i~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~j~0 := 0; 3030#L28-4 assume true; 3047#L28-1 assume !!(main_~j~0 < 10); 3111#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3110#L29-1 havoc main_#t~nondet6; 3109#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3108#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3107#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3048#L28-4 assume true; 3040#L28-1 assume !!(main_~j~0 < 10); 3028#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3025#L29-1 havoc main_#t~nondet6; 3026#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3042#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3043#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3050#L28-4 assume true; 3106#L28-1 assume !!(main_~j~0 < 10); 3105#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3104#L29-1 havoc main_#t~nondet6; 3103#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3102#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3101#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3100#L28-4 assume true; 3099#L28-1 assume !!(main_~j~0 < 10); 3098#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3097#L29-1 havoc main_#t~nondet6; 3096#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3095#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3094#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3093#L28-4 assume true; 3092#L28-1 assume !!(main_~j~0 < 10); 3091#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3090#L29-1 havoc main_#t~nondet6; 3089#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3088#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3087#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3086#L28-4 assume true; 3085#L28-1 assume !!(main_~j~0 < 10); 3084#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3083#L29-1 havoc main_#t~nondet6; 3082#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3081#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3080#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3079#L28-4 assume true; 3078#L28-1 assume !!(main_~j~0 < 10); 3077#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3076#L29-1 havoc main_#t~nondet6; 3075#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3074#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3073#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3072#L28-4 assume true; 3071#L28-1 assume !!(main_~j~0 < 10); 3070#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3069#L29-1 havoc main_#t~nondet6; 3068#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3067#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3066#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3065#L28-4 assume true; 3064#L28-1 assume !!(main_~j~0 < 10); 3063#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3062#L29-1 havoc main_#t~nondet6; 3061#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3060#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3059#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3058#L28-4 assume true; 3052#L28-1 assume !!(main_~j~0 < 10); 3057#L29 SUMMARY for call write~int(main_#t~nondet6, main_~#a~0.base, main_~#a~0.offset + main_~j~0 * 4, 4); srcloc: L29 3056#L29-1 havoc main_#t~nondet6; 3055#L30 SUMMARY for call write~$Pointer$(main_#t~nondet7.base, main_#t~nondet7.offset, main_~#dummies~0.base, main_~#dummies~0.offset + main_~j~0 * 4, 4); srcloc: L30 3054#L30-1 havoc main_#t~nondet7.base, main_#t~nondet7.offset; 3053#L28-3 main_#t~post5 := main_~j~0;main_~j~0 := main_#t~post5 + 1;havoc main_#t~post5; 3051#L28-4 assume true; 3038#L28-1 assume !(main_~j~0 < 10); 3039#L28-5 assume main_~i~0 >= 0 && main_~i~0 < 9; 3046#L33 SUMMARY for call write~int(main_~i~0, main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L33 3044#L33-1 SUMMARY for call write~$Pointer$(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, main_~#dummy~0.base, main_~#dummy~0.offset + 0, 4); srcloc: L33-1 3031#L34 SUMMARY for call write~$Pointer$(main_~#dummy~0.base, main_~#dummy~0.offset, main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L34 3032#L35 SUMMARY for call write~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + 0, main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L35 3033#L36 SUMMARY for call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~#cont~0.base, main_~#cont~0.offset + 0, 4); srcloc: L36 3034#L37 SUMMARY for call main_#t~mem9.base, main_#t~mem9.offset := read~$Pointer$(main_#t~mem8.base, main_#t~mem8.offset + main_~i~0 * 4, 4); srcloc: L37 3035#L37-1 SUMMARY for call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_#t~mem9.base, main_#t~mem9.offset + 0, 4); srcloc: L37-1 3049#L37-2 main_~pa~0.base, main_~pa~0.offset := main_#t~mem10.base, main_#t~mem10.offset + main_~i~0 * 4;havoc main_#t~mem9.base, main_#t~mem9.offset;havoc main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; 3022#L38 SUMMARY for call main_#t~mem11 := read~int(main_~#a~0.base, main_~#a~0.offset + main_~i~0 * 4, 4); srcloc: L38 3020#L38-1 assume main_#t~mem11 > 0;havoc main_#t~mem11; 3021#L39 SUMMARY for call main_#t~mem12.base, main_#t~mem12.offset := read~$Pointer$(main_~#dummies~0.base, main_~#dummies~0.offset + (main_~i~0 + 1) * 4, 4); srcloc: L39 3041#L39-1 SUMMARY for call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_#t~mem12.base, main_#t~mem12.offset + 0, 4); srcloc: L39-1 3036#L39-2 SUMMARY for call main_#t~mem14 := read~int(main_#t~mem13.base, main_#t~mem13.offset + main_~i~0 * 4, 4); srcloc: L39-2 3037#L39-3 main_~i~0 := main_#t~mem14 - 10;havoc main_#t~mem12.base, main_#t~mem12.offset;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~mem14; 3024#L40-4 [2018-11-10 12:24:24,768 INFO L795 eck$LassoCheckResult]: Loop: 3024#L40-4 assume true; 3027#L40-1 SUMMARY for call main_#t~mem15 := read~int(main_~pa~0.base, main_~pa~0.offset, 4); srcloc: L40-1 3023#L40-2 assume !!(main_~i~0 < main_#t~mem15);havoc main_#t~mem15;main_#t~pre16 := main_~i~0 + 1;main_~i~0 := main_~i~0 + 1;havoc main_#t~pre16; 3024#L40-4 [2018-11-10 12:24:24,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1462380966, now seen corresponding path program 10 times [2018-11-10 12:24:24,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 72559, now seen corresponding path program 11 times [2018-11-10 12:24:24,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:24,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:24:24,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1938032010, now seen corresponding path program 1 times [2018-11-10 12:24:24,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:24:24,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:24:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:24:24,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:24:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:24:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:27:35,664 WARN L179 SmtUtils]: Spent 3.18 m on a formula simplification. DAG size of input: 533 DAG size of output: 424 [2018-11-10 12:27:41,504 WARN L179 SmtUtils]: Spent 5.81 s on a formula simplification that was a NOOP. DAG size: 241 [2018-11-10 12:27:41,507 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:27:41,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:27:41,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:27:41,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:27:41,508 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:27:41,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:27:41,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:27:41,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:27:41,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: test27_false-unreach-call_true-termination.c_Iteration12_Lasso [2018-11-10 12:27:41,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:27:41,508 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:27:41,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:41,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:48,194 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-10 12:27:48,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:27:48,401 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:27:48,401 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:27:48,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,445 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:27:48,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,446 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:27:48,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,473 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:27:48,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,474 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:27:48,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,478 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:27:48,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:27:48,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,495 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:27:48,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,496 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:27:48,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:27:48,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:27:48,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:27:48,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:27:48,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:27:48,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:27:48,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:27:48,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:27:48,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:27:48,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:27:48,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:27:48,507 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:27:48,509 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:27:48,509 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:27:48,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:27:48,509 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:27:48,509 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:27:48,510 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)_1 Supporting invariants [] [2018-11-10 12:27:48,611 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 12:27:48,612 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:27:48,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:27:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:27:48,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:27:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:27:48,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:27:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:27:48,676 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:27:48,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 93 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 12:27:48,686 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 93 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 95 states and 97 transitions. Complement of second has 6 states. [2018-11-10 12:27:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:27:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:27:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 12:27:48,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 89 letters. Loop has 3 letters. [2018-11-10 12:27:48,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:27:48,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 92 letters. Loop has 3 letters. [2018-11-10 12:27:48,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:27:48,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 89 letters. Loop has 6 letters. [2018-11-10 12:27:48,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:27:48,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 97 transitions. [2018-11-10 12:27:48,690 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:27:48,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 0 states and 0 transitions. [2018-11-10 12:27:48,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:27:48,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:27:48,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:27:48,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:27:48,690 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:27:48,690 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:27:48,690 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:27:48,690 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:27:48,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:27:48,691 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:27:48,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:27:48,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:27:48 BoogieIcfgContainer [2018-11-10 12:27:48,704 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:27:48,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:27:48,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:27:48,705 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:27:48,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:24:17" (3/4) ... [2018-11-10 12:27:48,710 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:27:48,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:27:48,710 INFO L168 Benchmark]: Toolchain (without parser) took 211964.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -115.1 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:27:48,711 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:27:48,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 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-11-10 12:27:48,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.85 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:27:48,712 INFO L168 Benchmark]: Boogie Preprocessor took 63.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.7 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:27:48,712 INFO L168 Benchmark]: RCFGBuilder took 269.35 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:27:48,713 INFO L168 Benchmark]: BuchiAutomizer took 211423.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:27:48,713 INFO L168 Benchmark]: Witness Printer took 4.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:27:48,716 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.21 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 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 36.85 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.7 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 269.35 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 211423.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * j + 19 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#memory_int-unknown[pa][pa] and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 211.3s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 210.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 92 states and ocurred in iteration 11. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 304 SDtfs, 341 SDslu, 1219 SDs, 0 SdLazy, 341 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1036 mio100 ax100 hnf99 lsp97 ukn41 mio100 lsp32 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...