./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e150e83dea41703782a488455769a24bf6c8f600 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:21:38,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:21:38,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:21:38,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:21:38,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:21:38,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:21:38,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:21:38,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:21:38,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:21:38,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:21:38,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:21:38,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:21:38,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:21:38,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:21:38,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:21:38,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:21:38,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:21:38,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:21:38,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:21:38,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:21:38,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:21:38,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:21:38,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:21:38,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:21:38,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:21:38,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:21:38,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:21:38,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:21:38,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:21:38,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:21:38,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:21:38,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:21:38,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:21:38,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:21:38,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:21:38,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:21:38,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:21:38,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:21:38,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:21:38,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:21:38,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:21:38,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 14:21:38,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:21:38,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:21:38,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:21:38,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:21:38,073 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:21:38,073 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 14:21:38,073 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 14:21:38,074 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 14:21:38,074 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 14:21:38,074 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 14:21:38,074 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 14:21:38,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:21:38,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 14:21:38,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 14:21:38,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 14:21:38,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:21:38,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:21:38,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:21:38,077 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 14:21:38,077 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 14:21:38,077 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e150e83dea41703782a488455769a24bf6c8f600 [2019-12-07 14:21:38,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:21:38,192 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:21:38,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:21:38,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:21:38,197 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:21:38,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep.i [2019-12-07 14:21:38,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/data/84e0a78e5/6de14124d76b44b2a0c35999255764ba/FLAG92aa51275 [2019-12-07 14:21:38,662 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:21:38,663 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/sv-benchmarks/c/reducercommutativity/sep.i [2019-12-07 14:21:38,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/data/84e0a78e5/6de14124d76b44b2a0c35999255764ba/FLAG92aa51275 [2019-12-07 14:21:38,676 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/data/84e0a78e5/6de14124d76b44b2a0c35999255764ba [2019-12-07 14:21:38,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:21:38,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:21:38,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:21:38,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:21:38,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:21:38,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619ba5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38, skipping insertion in model container [2019-12-07 14:21:38,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:21:38,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:21:38,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:21:38,854 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:21:38,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:21:38,877 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:21:38,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38 WrapperNode [2019-12-07 14:21:38,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:21:38,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:21:38,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:21:38,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:21:38,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:21:38,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:21:38,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:21:38,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:21:38,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... [2019-12-07 14:21:38,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:21:38,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:21:38,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:21:38,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:21:38,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:21:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:21:38,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:21:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:21:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:21:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:21:39,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:21:39,153 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-07 14:21:39,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:21:39 BoogieIcfgContainer [2019-12-07 14:21:39,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:21:39,154 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 14:21:39,154 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 14:21:39,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 14:21:39,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:39,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 02:21:38" (1/3) ... [2019-12-07 14:21:39,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@609a7bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:21:39, skipping insertion in model container [2019-12-07 14:21:39,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:39,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:21:38" (2/3) ... [2019-12-07 14:21:39,158 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@609a7bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 02:21:39, skipping insertion in model container [2019-12-07 14:21:39,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 14:21:39,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:21:39" (3/3) ... [2019-12-07 14:21:39,159 INFO L371 chiAutomizerObserver]: Analyzing ICFG sep.i [2019-12-07 14:21:39,188 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 14:21:39,188 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 14:21:39,188 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 14:21:39,188 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:21:39,188 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:21:39,189 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 14:21:39,189 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:21:39,189 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 14:21:39,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-12-07 14:21:39,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 14:21:39,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:39,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:39,215 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-12-07 14:21:39,215 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:39,215 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 14:21:39,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-12-07 14:21:39,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-12-07 14:21:39,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:39,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:39,218 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-12-07 14:21:39,218 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:39,223 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 14#L23true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L9-3true [2019-12-07 14:21:39,223 INFO L796 eck$LassoCheckResult]: Loop: 6#L9-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 28#L11true assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 7#L9-2true sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 6#L9-3true [2019-12-07 14:21:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 14:21:39,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:39,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964820229] [2019-12-07 14:21:39,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2019-12-07 14:21:39,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:39,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781147663] [2019-12-07 14:21:39,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:39,338 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2019-12-07 14:21:39,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:39,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362679674] [2019-12-07 14:21:39,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:39,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:39,555 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:39,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:39,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:39,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:39,556 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:39,556 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,556 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:39,556 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:39,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2019-12-07 14:21:39,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:39,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:39,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:39,898 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:21:39,902 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:39,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:39,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:39,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:39,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:39,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:39,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:39,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:39,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:39,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:39,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:39,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:39,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:39,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:40,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:40,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:40,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:40,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:40,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:40,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:40,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:40,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:40,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:40,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:40,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:40,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:40,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:40,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:21:40,137 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-12-07 14:21:40,137 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:40,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:21:40,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 14:21:40,149 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:21:40,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2019-12-07 14:21:40,162 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 14:21:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:21:40,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:21:40,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:40,230 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 [2019-12-07 14:21:40,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 3 states. [2019-12-07 14:21:40,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 3 states. Result 57 states and 81 transitions. Complement of second has 8 states. [2019-12-07 14:21:40,275 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 [2019-12-07 14:21:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 14:21:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-12-07 14:21:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2019-12-07 14:21:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-12-07 14:21:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2019-12-07 14:21:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:40,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2019-12-07 14:21:40,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2019-12-07 14:21:40,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 14:21:40,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 14:21:40,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-12-07 14:21:40,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:40,288 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-07 14:21:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-12-07 14:21:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 14:21:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 14:21:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-12-07 14:21:40,307 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-07 14:21:40,307 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-07 14:21:40,307 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 14:21:40,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-12-07 14:21:40,308 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:40,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:40,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 14:21:40,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:40,308 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 156#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 157#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 147#L9-3 assume !(sep_~i~0 < ~N~0); 144#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 145#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 146#L9-8 [2019-12-07 14:21:40,308 INFO L796 eck$LassoCheckResult]: Loop: 146#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 154#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 155#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 146#L9-8 [2019-12-07 14:21:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2019-12-07 14:21:40,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760441816] [2019-12-07 14:21:40,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:40,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760441816] [2019-12-07 14:21:40,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:21:40,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:21:40,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161300749] [2019-12-07 14:21:40,356 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2019-12-07 14:21:40,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408420678] [2019-12-07 14:21:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:40,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:21:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:21:40,426 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-12-07 14:21:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:40,445 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-12-07 14:21:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:21:40,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2019-12-07 14:21:40,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2019-12-07 14:21:40,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 14:21:40,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 14:21:40,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2019-12-07 14:21:40,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:40,449 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-12-07 14:21:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2019-12-07 14:21:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-12-07 14:21:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 14:21:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-12-07 14:21:40,451 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-12-07 14:21:40,451 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-12-07 14:21:40,451 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 14:21:40,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-12-07 14:21:40,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:40,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:40,452 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:40,452 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:40,452 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 204#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 205#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 195#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 196#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 200#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 197#L9-3 assume !(sep_~i~0 < ~N~0); 192#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 193#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 194#L9-8 [2019-12-07 14:21:40,453 INFO L796 eck$LassoCheckResult]: Loop: 194#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 202#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 203#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 194#L9-8 [2019-12-07 14:21:40,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,453 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2019-12-07 14:21:40,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296896302] [2019-12-07 14:21:40,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:40,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296896302] [2019-12-07 14:21:40,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760384025] [2019-12-07 14:21:40,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:21:40,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:40,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:40,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-07 14:21:40,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578785789] [2019-12-07 14:21:40,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2019-12-07 14:21:40,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67403839] [2019-12-07 14:21:40,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:40,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:21:40,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:21:40,601 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-12-07 14:21:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:40,632 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-12-07 14:21:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:21:40,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2019-12-07 14:21:40,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2019-12-07 14:21:40,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 14:21:40,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 14:21:40,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-12-07 14:21:40,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:40,634 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-12-07 14:21:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-12-07 14:21:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-12-07 14:21:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 14:21:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-12-07 14:21:40,636 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-12-07 14:21:40,636 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-12-07 14:21:40,636 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 14:21:40,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-12-07 14:21:40,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:40,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:40,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:40,637 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:40,637 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:40,638 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 284#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 285#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 273#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 274#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 279#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 275#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 276#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 289#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 290#L9-3 assume !(sep_~i~0 < ~N~0); 270#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 271#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 272#L9-8 [2019-12-07 14:21:40,638 INFO L796 eck$LassoCheckResult]: Loop: 272#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 281#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 282#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 272#L9-8 [2019-12-07 14:21:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2019-12-07 14:21:40,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041581386] [2019-12-07 14:21:40,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,681 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2019-12-07 14:21:40,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300869900] [2019-12-07 14:21:40,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:40,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2019-12-07 14:21:40,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:40,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058666617] [2019-12-07 14:21:40,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058666617] [2019-12-07 14:21:40,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810014714] [2019-12-07 14:21:40,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:40,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 14:21:40,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:41,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-12-07 14:21:41,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:41,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:41,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:41,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-12-07 14:21:41,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 14:21:41,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:41,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:41,029 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:41,029 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-12-07 14:21:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:41,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:41,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-07 14:21:41,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894648579] [2019-12-07 14:21:41,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:21:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:21:41,084 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-12-07 14:21:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:41,490 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-12-07 14:21:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:21:41,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2019-12-07 14:21:41,492 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-12-07 14:21:41,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 89 transitions. [2019-12-07 14:21:41,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-12-07 14:21:41,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-12-07 14:21:41,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 89 transitions. [2019-12-07 14:21:41,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:41,495 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 89 transitions. [2019-12-07 14:21:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 89 transitions. [2019-12-07 14:21:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 31. [2019-12-07 14:21:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 14:21:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-12-07 14:21:41,499 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-12-07 14:21:41,499 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-12-07 14:21:41,499 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 14:21:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2019-12-07 14:21:41,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:41,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:41,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:41,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:41,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:41,500 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 442#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 443#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 431#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 432#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 438#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 433#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 434#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 453#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 448#L9-3 assume !(sep_~i~0 < ~N~0); 449#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 429#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 430#L9-8 [2019-12-07 14:21:41,500 INFO L796 eck$LassoCheckResult]: Loop: 430#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 447#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 440#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 430#L9-8 [2019-12-07 14:21:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2019-12-07 14:21:41,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:41,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64117552] [2019-12-07 14:21:41,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2019-12-07 14:21:41,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:41,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510257891] [2019-12-07 14:21:41,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2019-12-07 14:21:41,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:41,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796045917] [2019-12-07 14:21:41,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:41,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:41,887 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 129 [2019-12-07 14:21:42,088 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-12-07 14:21:42,090 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:42,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:42,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:42,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:42,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:42,091 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:42,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:42,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2019-12-07 14:21:42,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:42,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:42,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:42,401 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:21:42,401 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:42,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:42,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:42,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:42,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:42,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:42,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:42,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:42,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:42,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:42,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:42,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:42,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:42,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:42,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:42,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:42,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:42,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:42,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:42,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:42,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:42,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:42,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:42,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:42,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:42,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:42,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:21:42,503 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-12-07 14:21:42,504 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:42,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:21:42,508 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 14:21:42,508 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:21:42,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset - 4*ULTIMATE.start_sep_~i~0 + 5 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_sep_~x.base)_2 + 8 >= 0] [2019-12-07 14:21:42,520 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-12-07 14:21:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:42,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:21:42,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:42,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 14:21:42,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:42,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:42,556 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:42,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 14:21:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:42,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:21:42,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:42,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-12-07 14:21:42,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-12-07 14:21:42,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 65 states and 93 transitions. Complement of second has 12 states. [2019-12-07 14:21:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 14:21:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 14:21:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2019-12-07 14:21:42,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 12 letters. Loop has 3 letters. [2019-12-07 14:21:42,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:42,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 15 letters. Loop has 3 letters. [2019-12-07 14:21:42,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:42,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 12 letters. Loop has 6 letters. [2019-12-07 14:21:42,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:42,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2019-12-07 14:21:42,715 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-12-07 14:21:42,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 57 states and 79 transitions. [2019-12-07 14:21:42,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-12-07 14:21:42,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-12-07 14:21:42,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 79 transitions. [2019-12-07 14:21:42,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:42,716 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-12-07 14:21:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 79 transitions. [2019-12-07 14:21:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2019-12-07 14:21:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 14:21:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2019-12-07 14:21:42,719 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-12-07 14:21:42,719 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2019-12-07 14:21:42,719 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 14:21:42,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2019-12-07 14:21:42,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:42,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:42,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:42,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:42,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:21:42,720 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 650#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 651#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 638#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 639#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 677#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 675#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 672#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 669#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 666#L9-3 assume !(sep_~i~0 < ~N~0); 664#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 662#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 661#L9-8 assume !(sep_~i~0 < ~N~0); 654#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 633#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 634#L35-3 [2019-12-07 14:21:42,721 INFO L796 eck$LassoCheckResult]: Loop: 634#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 655#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 634#L35-3 [2019-12-07 14:21:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2019-12-07 14:21:42,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:42,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802649796] [2019-12-07 14:21:42,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:21:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802649796] [2019-12-07 14:21:42,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:21:42,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:21:42,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576306654] [2019-12-07 14:21:42,749 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2019-12-07 14:21:42,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:42,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747953722] [2019-12-07 14:21:42,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:42,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:21:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:21:42,786 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-12-07 14:21:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:42,809 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2019-12-07 14:21:42,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:21:42,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 70 transitions. [2019-12-07 14:21:42,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:42,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 70 transitions. [2019-12-07 14:21:42,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-12-07 14:21:42,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-12-07 14:21:42,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 70 transitions. [2019-12-07 14:21:42,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:42,811 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 70 transitions. [2019-12-07 14:21:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 70 transitions. [2019-12-07 14:21:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-12-07 14:21:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 14:21:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-12-07 14:21:42,814 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-12-07 14:21:42,814 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-12-07 14:21:42,814 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 14:21:42,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 60 transitions. [2019-12-07 14:21:42,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:42,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:42,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:42,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:42,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:42,815 INFO L794 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 755#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 756#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 743#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 744#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 780#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 779#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 778#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 749#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 745#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 746#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 761#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 783#L9-3 assume !(sep_~i~0 < ~N~0); 782#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 781#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 762#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 763#L11-2 [2019-12-07 14:21:42,816 INFO L796 eck$LassoCheckResult]: Loop: 763#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 752#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 766#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 763#L11-2 [2019-12-07 14:21:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1339633664, now seen corresponding path program 1 times [2019-12-07 14:21:42,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:42,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579219064] [2019-12-07 14:21:42,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 66653, now seen corresponding path program 5 times [2019-12-07 14:21:42,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:42,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871066883] [2019-12-07 14:21:42,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash 190406654, now seen corresponding path program 2 times [2019-12-07 14:21:42,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:42,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443907044] [2019-12-07 14:21:42,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:42,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:43,337 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 153 [2019-12-07 14:21:43,687 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-12-07 14:21:43,689 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:43,689 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:43,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:43,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:43,689 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:43,689 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:43,689 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:43,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:43,689 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration7_Lasso [2019-12-07 14:21:43,689 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:43,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:43,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:43,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:44,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:21:44,019 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:44,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:44,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:44,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:44,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:44,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:44,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:44,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:44,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:44,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:44,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:44,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:44,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:44,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:44,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:44,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:44,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:44,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:44,129 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:21:44,155 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-12-07 14:21:44,155 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:44,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:21:44,160 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 14:21:44,160 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:21:44,160 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x.base)_3, ULTIMATE.start_sep_~i~0) = 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_3 - 2*ULTIMATE.start_sep_~i~0 Supporting invariants [-2*~N~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 >= 0] [2019-12-07 14:21:44,177 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2019-12-07 14:21:44,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 14:21:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:44,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 14:21:44,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:44,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 14:21:44,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:44,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 14:21:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:44,272 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:21:44,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:44,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-12-07 14:21:44,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 60 transitions. cyclomatic complexity: 20 Second operand 9 states. [2019-12-07 14:21:44,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 60 transitions. cyclomatic complexity: 20. Second operand 9 states. Result 60 states and 82 transitions. Complement of second has 13 states. [2019-12-07 14:21:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-12-07 14:21:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 14:21:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2019-12-07 14:21:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 16 letters. Loop has 3 letters. [2019-12-07 14:21:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 19 letters. Loop has 3 letters. [2019-12-07 14:21:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 16 letters. Loop has 6 letters. [2019-12-07 14:21:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:44,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 82 transitions. [2019-12-07 14:21:44,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-12-07 14:21:44,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 76 transitions. [2019-12-07 14:21:44,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-12-07 14:21:44,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-12-07 14:21:44,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 76 transitions. [2019-12-07 14:21:44,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:44,425 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 76 transitions. [2019-12-07 14:21:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 76 transitions. [2019-12-07 14:21:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-12-07 14:21:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 14:21:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2019-12-07 14:21:44,428 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 68 transitions. [2019-12-07 14:21:44,428 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 68 transitions. [2019-12-07 14:21:44,428 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 14:21:44,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 68 transitions. [2019-12-07 14:21:44,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 14:21:44,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:44,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:44,429 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:44,429 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:21:44,429 INFO L794 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 999#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1000#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 985#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 986#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 991#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 987#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 988#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1027#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1025#L9-3 assume !(sep_~i~0 < ~N~0); 982#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 983#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 984#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1006#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 997#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1005#L9-8 assume !(sep_~i~0 < ~N~0); 1001#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 980#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 981#L35-3 [2019-12-07 14:21:44,429 INFO L796 eck$LassoCheckResult]: Loop: 981#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1002#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 981#L35-3 [2019-12-07 14:21:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2019-12-07 14:21:44,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:44,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770657015] [2019-12-07 14:21:44,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:21:44,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770657015] [2019-12-07 14:21:44,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130272524] [2019-12-07 14:21:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:44,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:21:44,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:21:44,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:44,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 14:21:44,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988135174] [2019-12-07 14:21:44,513 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2019-12-07 14:21:44,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:44,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492906603] [2019-12-07 14:21:44,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:44,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:44,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:44,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:21:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:21:44,557 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. cyclomatic complexity: 25 Second operand 7 states. [2019-12-07 14:21:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:44,606 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2019-12-07 14:21:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:21:44,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2019-12-07 14:21:44,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 14:21:44,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 88 transitions. [2019-12-07 14:21:44,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-12-07 14:21:44,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-12-07 14:21:44,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 88 transitions. [2019-12-07 14:21:44,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:44,609 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 88 transitions. [2019-12-07 14:21:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 88 transitions. [2019-12-07 14:21:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2019-12-07 14:21:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:21:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2019-12-07 14:21:44,612 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-12-07 14:21:44,612 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2019-12-07 14:21:44,612 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 14:21:44,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 69 transitions. [2019-12-07 14:21:44,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 14:21:44,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:44,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:44,613 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:44,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:21:44,613 INFO L794 eck$LassoCheckResult]: Stem: 1180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1177#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1178#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1165#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1166#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1205#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1204#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1203#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1201#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1198#L9-3 assume !(sep_~i~0 < ~N~0); 1193#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1194#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1196#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1195#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1176#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1183#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1184#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1188#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1187#L9-8 assume !(sep_~i~0 < ~N~0); 1181#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1159#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1160#L35-3 [2019-12-07 14:21:44,613 INFO L796 eck$LassoCheckResult]: Loop: 1160#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1182#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1160#L35-3 [2019-12-07 14:21:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2019-12-07 14:21:44,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:44,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786993329] [2019-12-07 14:21:44,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:21:44,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786993329] [2019-12-07 14:21:44,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193368422] [2019-12-07 14:21:44,802 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:44,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:21:44,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:21:44,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 14:21:44,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:44,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-12-07 14:21:44,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:44,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:22 [2019-12-07 14:21:44,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 14:21:44,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:44,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:44,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-12-07 14:21:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 14:21:44,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:44,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 14:21:44,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961159206] [2019-12-07 14:21:44,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2019-12-07 14:21:44,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:44,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680828689] [2019-12-07 14:21:44,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:44,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:44,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:44,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:21:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:21:44,943 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. cyclomatic complexity: 23 Second operand 10 states. [2019-12-07 14:21:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:45,190 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-12-07 14:21:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:21:45,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 114 transitions. [2019-12-07 14:21:45,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-12-07 14:21:45,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 114 transitions. [2019-12-07 14:21:45,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-12-07 14:21:45,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-12-07 14:21:45,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 114 transitions. [2019-12-07 14:21:45,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:45,192 INFO L688 BuchiCegarLoop]: Abstraction has 86 states and 114 transitions. [2019-12-07 14:21:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 114 transitions. [2019-12-07 14:21:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2019-12-07 14:21:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:21:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2019-12-07 14:21:45,195 INFO L711 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-12-07 14:21:45,195 INFO L591 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-12-07 14:21:45,195 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 14:21:45,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 67 transitions. [2019-12-07 14:21:45,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 14:21:45,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:45,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:45,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:45,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 14:21:45,196 INFO L794 eck$LassoCheckResult]: Stem: 1399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1396#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1397#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1384#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1385#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1390#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1386#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1387#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1416#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1412#L9-3 assume !(sep_~i~0 < ~N~0); 1413#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1382#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1383#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1429#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1395#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1403#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1404#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1419#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1410#L9-8 assume !(sep_~i~0 < ~N~0); 1400#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1378#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1379#L35-3 [2019-12-07 14:21:45,196 INFO L796 eck$LassoCheckResult]: Loop: 1379#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1401#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1379#L35-3 [2019-12-07 14:21:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2019-12-07 14:21:45,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:45,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476814830] [2019-12-07 14:21:45,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:45,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2019-12-07 14:21:45,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:45,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289699356] [2019-12-07 14:21:45,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2019-12-07 14:21:45,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:45,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113003782] [2019-12-07 14:21:45,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:45,257 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:46,145 WARN L192 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 187 [2019-12-07 14:21:46,907 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 100 [2019-12-07 14:21:46,909 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:46,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:46,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:46,910 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:46,910 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:46,910 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:46,910 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:46,910 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:46,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration10_Lasso [2019-12-07 14:21:46,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:46,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:46,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:46,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:47,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:21:47,396 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:47,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:47,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:47,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:47,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:47,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:47,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:47,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:47,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:47,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:47,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:47,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:47,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:47,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:47,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:47,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:47,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:47,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:47,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:47,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:47,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:47,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:47,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:47,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:47,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:47,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:47,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:47,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:47,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:47,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:47,490 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:21:47,526 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-12-07 14:21:47,526 INFO L444 ModelExtractionUtils]: 4 out of 28 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:47,528 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:21:47,530 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 14:21:47,530 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:21:47,531 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-12-07 14:21:47,547 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-12-07 14:21:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:47,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:21:47,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:47,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:21:47,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:47,576 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 [2019-12-07 14:21:47,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 67 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-12-07 14:21:47,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 67 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 58 states and 78 transitions. Complement of second has 6 states. [2019-12-07 14:21:47,587 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 [2019-12-07 14:21:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 14:21:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-12-07 14:21:47,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2019-12-07 14:21:47,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:47,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2019-12-07 14:21:47,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:47,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2019-12-07 14:21:47,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:47,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2019-12-07 14:21:47,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:47,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 69 transitions. [2019-12-07 14:21:47,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-12-07 14:21:47,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-12-07 14:21:47,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2019-12-07 14:21:47,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:47,589 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 14:21:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2019-12-07 14:21:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 14:21:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:21:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-12-07 14:21:47,591 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 14:21:47,591 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-12-07 14:21:47,591 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 14:21:47,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 69 transitions. [2019-12-07 14:21:47,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:47,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:47,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:47,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:47,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:47,593 INFO L794 eck$LassoCheckResult]: Stem: 1624#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1621#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1622#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1609#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1610#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1615#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1611#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1612#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1652#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1653#L9-3 assume !(sep_~i~0 < ~N~0); 1606#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1607#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1608#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1628#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1639#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1629#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1619#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1620#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1632#L9-8 assume !(sep_~i~0 < ~N~0); 1625#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1604#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1605#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1623#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1613#L9-13 [2019-12-07 14:21:47,593 INFO L796 eck$LassoCheckResult]: Loop: 1613#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1614#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1616#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1613#L9-13 [2019-12-07 14:21:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2019-12-07 14:21:47,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:47,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381534288] [2019-12-07 14:21:47,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 14:21:47,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381534288] [2019-12-07 14:21:47,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:21:47,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:21:47,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448062494] [2019-12-07 14:21:47,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2019-12-07 14:21:47,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:47,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670673739] [2019-12-07 14:21:47,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:47,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:21:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:21:47,669 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-12-07 14:21:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:47,683 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-12-07 14:21:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:21:47,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 69 transitions. [2019-12-07 14:21:47,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:47,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 69 transitions. [2019-12-07 14:21:47,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-12-07 14:21:47,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-12-07 14:21:47,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2019-12-07 14:21:47,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:47,685 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-12-07 14:21:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2019-12-07 14:21:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-12-07 14:21:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:21:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-12-07 14:21:47,687 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-12-07 14:21:47,688 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-12-07 14:21:47,688 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 14:21:47,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 68 transitions. [2019-12-07 14:21:47,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:47,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:47,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:47,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:47,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:47,689 INFO L794 eck$LassoCheckResult]: Stem: 1738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1735#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1736#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1723#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1724#L11 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1729#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1725#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1726#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1765#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1762#L9-3 assume !(sep_~i~0 < ~N~0); 1720#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1721#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1722#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1742#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1767#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1743#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1733#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 1734#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1746#L9-8 assume !(sep_~i~0 < ~N~0); 1739#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1718#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1719#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1740#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1741#L35-3 assume !(main_~i~1 < ~N~0 - 1); 1737#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1727#L9-13 [2019-12-07 14:21:47,689 INFO L796 eck$LassoCheckResult]: Loop: 1727#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1728#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 1730#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 1727#L9-13 [2019-12-07 14:21:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2019-12-07 14:21:47,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:47,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199120251] [2019-12-07 14:21:47,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2019-12-07 14:21:47,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:47,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288749901] [2019-12-07 14:21:47,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:47,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2019-12-07 14:21:47,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:47,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552271572] [2019-12-07 14:21:47,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 14:21:48,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552271572] [2019-12-07 14:21:48,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655389757] [2019-12-07 14:21:48,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:48,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 14:21:48,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:48,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:48,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:48,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2019-12-07 14:21:48,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:48,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:19 [2019-12-07 14:21:48,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:48,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-12-07 14:21:48,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:48,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-12-07 14:21:48,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:21:48,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:48,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 59 [2019-12-07 14:21:48,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,371 INFO L614 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-12-07 14:21:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:21:48,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2019-12-07 14:21:48,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 14:21:48,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:48,396 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:48,396 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-12-07 14:21:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 14:21:48,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:48,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-12-07 14:21:48,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773591257] [2019-12-07 14:21:48,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:48,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 14:21:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:21:48,450 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. cyclomatic complexity: 21 Second operand 20 states. [2019-12-07 14:21:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:49,305 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2019-12-07 14:21:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 14:21:49,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 175 transitions. [2019-12-07 14:21:49,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 14:21:49,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 175 transitions. [2019-12-07 14:21:49,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2019-12-07 14:21:49,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-12-07 14:21:49,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 175 transitions. [2019-12-07 14:21:49,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:49,308 INFO L688 BuchiCegarLoop]: Abstraction has 137 states and 175 transitions. [2019-12-07 14:21:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 175 transitions. [2019-12-07 14:21:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2019-12-07 14:21:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 14:21:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2019-12-07 14:21:49,312 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 136 transitions. [2019-12-07 14:21:49,312 INFO L591 BuchiCegarLoop]: Abstraction has 106 states and 136 transitions. [2019-12-07 14:21:49,312 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 14:21:49,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 136 transitions. [2019-12-07 14:21:49,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:49,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:49,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:49,313 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:49,313 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:49,313 INFO L794 eck$LassoCheckResult]: Stem: 2064#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2061#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2062#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2047#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2048#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2126#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2125#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2124#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2122#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2118#L9-3 assume !(sep_~i~0 < ~N~0); 2112#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2108#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2104#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2100#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2097#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2096#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2090#L11-2 assume !(0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2));havoc sep_#t~mem1;sep_#t~post3 := sep_~ret~0;sep_~ret~0 := sep_#t~post3 - 1;havoc sep_#t~post3; 2092#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2089#L9-8 assume !(sep_~i~0 < ~N~0); 2087#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2086#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2085#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2084#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2083#L35-3 assume !(main_~i~1 < ~N~0 - 1); 2063#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2051#L9-13 [2019-12-07 14:21:49,313 INFO L796 eck$LassoCheckResult]: Loop: 2051#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2052#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2055#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2051#L9-13 [2019-12-07 14:21:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1953404899, now seen corresponding path program 1 times [2019-12-07 14:21:49,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:49,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457502374] [2019-12-07 14:21:49,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:21:49,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457502374] [2019-12-07 14:21:49,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379835458] [2019-12-07 14:21:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:21:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:49,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 14:21:49,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:49,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:49,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2019-12-07 14:21:49,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:49,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:49,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:49,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:22 [2019-12-07 14:21:49,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 14:21:49,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:21:49,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:21:49,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:21:49,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-12-07 14:21:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:21:49,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:21:49,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-12-07 14:21:49,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720508002] [2019-12-07 14:21:49,665 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 14:21:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2019-12-07 14:21:49,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:49,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48961381] [2019-12-07 14:21:49,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:49,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:49,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:21:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:21:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:21:49,717 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. cyclomatic complexity: 40 Second operand 13 states. [2019-12-07 14:21:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:21:50,050 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2019-12-07 14:21:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:21:50,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 170 transitions. [2019-12-07 14:21:50,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:50,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 133 states and 170 transitions. [2019-12-07 14:21:50,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2019-12-07 14:21:50,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-12-07 14:21:50,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 170 transitions. [2019-12-07 14:21:50,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 14:21:50,053 INFO L688 BuchiCegarLoop]: Abstraction has 133 states and 170 transitions. [2019-12-07 14:21:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 170 transitions. [2019-12-07 14:21:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2019-12-07 14:21:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 14:21:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2019-12-07 14:21:50,056 INFO L711 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2019-12-07 14:21:50,056 INFO L591 BuchiCegarLoop]: Abstraction has 110 states and 141 transitions. [2019-12-07 14:21:50,056 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 14:21:50,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 141 transitions. [2019-12-07 14:21:50,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-12-07 14:21:50,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 14:21:50,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 14:21:50,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:21:50,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 14:21:50,057 INFO L794 eck$LassoCheckResult]: Stem: 2411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2404#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2405#L23 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2389#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2390#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2470#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2391#L9-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2392#L11 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2396#L9-2 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2397#L9-3 assume !(sep_~i~0 < ~N~0); 2476#L9-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2492#L16 main_#t~ret5 := sep_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2491#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2490#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2418#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2414#L9-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2401#L11-2 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2402#L9-7 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2428#L9-8 assume !(sep_~i~0 < ~N~0); 2406#L9-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2407#L16-1 main_#t~ret8 := sep_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2423#L35-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2422#L35-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2421#L35-3 assume !(main_~i~1 < ~N~0 - 1); 2420#L35-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem1, sep_#t~post2, sep_#t~post3, sep_#t~post0, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2398#L9-13 [2019-12-07 14:21:50,057 INFO L796 eck$LassoCheckResult]: Loop: 2398#L9-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem1 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2419#L11-4 assume 0 == (if sep_#t~mem1 < 0 && 0 != sep_#t~mem1 % 2 then sep_#t~mem1 % 2 - 2 else sep_#t~mem1 % 2);havoc sep_#t~mem1;sep_#t~post2 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post2;havoc sep_#t~post2; 2395#L9-12 sep_#t~post0 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post0;havoc sep_#t~post0; 2398#L9-13 [2019-12-07 14:21:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1273346529, now seen corresponding path program 1 times [2019-12-07 14:21:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459482222] [2019-12-07 14:21:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 4 times [2019-12-07 14:21:50,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:50,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571790649] [2019-12-07 14:21:50,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,090 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1115355784, now seen corresponding path program 1 times [2019-12-07 14:21:50,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:21:50,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822303334] [2019-12-07 14:21:50,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:21:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:21:50,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:21:50,973 WARN L192 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 202 [2019-12-07 14:21:51,174 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-07 14:21:51,272 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 14:21:51,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 14:21:51,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 14:21:51,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 14:21:51,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 14:21:51,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 14:21:51,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 14:21:51,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration14_Lasso [2019-12-07 14:21:51,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 14:21:51,273 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 14:21:51,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 14:21:51,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 14:21:51,613 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 14:21:51,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 14:21:51,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 14:21:51,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 14:21:51,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 14:21:51,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 14:21:51,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 14:21:51,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 14:21:51,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 14:21:51,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 14:21:51,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 14:21:51,801 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-12-07 14:21:51,801 INFO L444 ModelExtractionUtils]: 6 out of 28 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4a1064a-cd62-4887-a023-f0e35b82041f/bin/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 14:21:51,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 14:21:51,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 14:21:51,805 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 14:21:51,805 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2019-12-07 14:21:51,827 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-12-07 14:21:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:21:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:51,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:21:51,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:21:51,852 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:21:51,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:21:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:21:51,858 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 [2019-12-07 14:21:51,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 141 transitions. cyclomatic complexity: 41 Second operand 3 states. [2019-12-07 14:21:51,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 141 transitions. cyclomatic complexity: 41. Second operand 3 states. Result 114 states and 148 transitions. Complement of second has 4 states. [2019-12-07 14:21:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 14:21:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 14:21:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2019-12-07 14:21:51,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2019-12-07 14:21:51,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:51,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2019-12-07 14:21:51,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:51,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2019-12-07 14:21:51,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 14:21:51,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 148 transitions. [2019-12-07 14:21:51,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:21:51,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 14:21:51,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 14:21:51,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 14:21:51,866 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 14:21:51,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:21:51,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 14:21:51,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 14:21:51,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 02:21:51 BoogieIcfgContainer [2019-12-07 14:21:51,870 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 14:21:51,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:21:51,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:21:51,871 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:21:51,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:21:39" (3/4) ... [2019-12-07 14:21:51,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:21:51,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:21:51,874 INFO L168 Benchmark]: Toolchain (without parser) took 13195.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 946.2 MB in the beginning and 1.0 GB in the end (delta: -96.6 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:51,874 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:21:51,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:51,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:21:51,875 INFO L168 Benchmark]: Boogie Preprocessor took 19.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:51,875 INFO L168 Benchmark]: RCFGBuilder took 228.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:51,875 INFO L168 Benchmark]: BuchiAutomizer took 12716.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 231.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:21:51,875 INFO L168 Benchmark]: Witness Printer took 2.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:21:51,876 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.08 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12716.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 231.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (9 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * x + -4 * i + 5 and consists of 9 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -2 * i and consists of 10 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 9.9s. Construction of modules took 1.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 167 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 110 states and ocurred in iteration 13. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 278 SDtfs, 357 SDslu, 764 SDs, 0 SdLazy, 1732 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU7 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp90 ukn67 mio100 lsp59 div102 bol100 ite103 ukn100 eq166 hnf86 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...