./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 160024a3cc4acfbc7213f984e87ef0c708b94aaf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:01:46,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:01:46,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:01:46,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:01:46,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:01:46,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:01:46,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:01:46,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:01:46,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:01:46,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:01:46,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:01:46,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:01:46,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:01:46,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:01:46,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:01:46,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:01:46,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:01:46,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:01:46,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:01:46,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:01:46,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:01:46,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:01:46,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:01:46,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:01:46,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:01:46,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:01:46,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:01:46,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:01:46,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:01:46,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:01:46,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:01:46,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:01:46,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:01:46,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:01:46,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:01:46,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:01:46,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:01:46,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:01:46,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:01:46,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:01:46,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:01:46,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:01:46,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:01:46,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:01:46,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:01:46,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:01:46,901 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:01:46,902 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:01:46,904 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:01:46,905 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:01:46,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:01:46,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:01:46,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:01:46,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:01:46,907 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:01:46,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:01:46,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:01:46,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:01:46,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:01:46,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:01:46,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:01:46,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:01:46,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:01:46,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:01:46,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:01:46,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:01:46,909 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:01:46,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:01:46,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:01:46,910 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:01:46,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:01:46,911 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 160024a3cc4acfbc7213f984e87ef0c708b94aaf [2019-11-28 03:01:47,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:01:47,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:01:47,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:01:47,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:01:47,271 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:01:47,272 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i [2019-11-28 03:01:47,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6a908be/3a33ef93ded249aea616f185a0aa5375/FLAG64e12b7e3 [2019-11-28 03:01:47,902 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:01:47,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/gcd1-alloca.i [2019-11-28 03:01:47,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6a908be/3a33ef93ded249aea616f185a0aa5375/FLAG64e12b7e3 [2019-11-28 03:01:48,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6a908be/3a33ef93ded249aea616f185a0aa5375 [2019-11-28 03:01:48,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:01:48,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:01:48,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:48,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:01:48,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:01:48,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f4bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48, skipping insertion in model container [2019-11-28 03:01:48,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:01:48,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:01:48,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:48,693 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:01:48,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:48,797 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:01:48,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48 WrapperNode [2019-11-28 03:01:48,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:48,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:48,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:01:48,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:01:48,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:48,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:01:48,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:01:48,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:01:48,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... [2019-11-28 03:01:48,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:01:48,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:01:48,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:01:48,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:01:48,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:01:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:01:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:01:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:01:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:01:48,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:01:49,291 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:01:49,291 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:01:49,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:49 BoogieIcfgContainer [2019-11-28 03:01:49,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:01:49,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:01:49,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:01:49,297 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:01:49,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:49,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:01:48" (1/3) ... [2019-11-28 03:01:49,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b7d25e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:49, skipping insertion in model container [2019-11-28 03:01:49,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:49,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:48" (2/3) ... [2019-11-28 03:01:49,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b7d25e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:49, skipping insertion in model container [2019-11-28 03:01:49,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:49,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:49" (3/3) ... [2019-11-28 03:01:49,303 INFO L371 chiAutomizerObserver]: Analyzing ICFG gcd1-alloca.i [2019-11-28 03:01:49,351 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:01:49,351 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:01:49,351 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:01:49,351 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:01:49,352 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:01:49,352 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:01:49,352 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:01:49,352 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:01:49,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:01:49,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:49,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:49,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:49,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:49,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:49,394 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:01:49,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:01:49,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:49,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:49,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:49,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:49,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:01:49,406 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 9#L553true assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 15#L553-2true call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 5#L554true assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 10#L555-2true [2019-11-28 03:01:49,406 INFO L796 eck$LassoCheckResult]: Loop: 10#L555-2true call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 4#L555true assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 6#L557-3true assume !true; 11#L557-4true call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 10#L555-2true [2019-11-28 03:01:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-28 03:01:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810294886] [2019-11-28 03:01:49,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:49,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1513768, now seen corresponding path program 1 times [2019-11-28 03:01:49,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:49,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668290533] [2019-11-28 03:01:49,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:49,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668290533] [2019-11-28 03:01:49,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:01:49,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:01:49,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205520620] [2019-11-28 03:01:49,669 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:01:49,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:01:49,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:01:49,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:01:49,689 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-28 03:01:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:01:49,696 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-28 03:01:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:01:49,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-28 03:01:49,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:49,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2019-11-28 03:01:49,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:01:49,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:01:49,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-28 03:01:49,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:01:49,707 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 03:01:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-28 03:01:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 03:01:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:01:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 03:01:49,734 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 03:01:49,734 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 03:01:49,734 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:01:49,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 03:01:49,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:49,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:49,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:49,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:49,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:49,736 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 39#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 42#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 45#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 41#L555-2 [2019-11-28 03:01:49,736 INFO L796 eck$LassoCheckResult]: Loop: 41#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 43#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 47#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 46#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 40#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 41#L555-2 [2019-11-28 03:01:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 2 times [2019-11-28 03:01:49,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:49,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484106263] [2019-11-28 03:01:49,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 1 times [2019-11-28 03:01:49,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:49,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654516868] [2019-11-28 03:01:49,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,838 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1985425099, now seen corresponding path program 1 times [2019-11-28 03:01:49,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:49,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618325151] [2019-11-28 03:01:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:49,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:50,060 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 03:01:50,569 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-11-28 03:01:50,713 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 03:01:50,728 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:50,729 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:50,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:50,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:50,735 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:50,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:50,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:50,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:50,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration2_Lasso [2019-11-28 03:01:50,736 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:50,736 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:50,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,201 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-28 03:01:51,356 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-28 03:01:51,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:51,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:52,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:52,017 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,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-11-28 03:01:52,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,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-11-28 03:01:52,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,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-11-28 03:01:52,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:52,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:52,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:52,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:52,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:52,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:52,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:52,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:52,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:52,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:52,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:52,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:52,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:52,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:52,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:52,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:52,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:52,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:52,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:52,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:52,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:52,454 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:01:52,454 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:52,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:52,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:01:52,543 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:52,544 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 Supporting invariants [] [2019-11-28 03:01:52,646 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 03:01:52,655 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:01:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:52,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:01:52,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:52,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:52,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 03:01:52,783 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:52,791 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:52,794 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:52,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-28 03:01:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:52,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:01:52,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:52,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:52,868 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 2 case distinctions, treesize of input 30 treesize of output 64 [2019-11-28 03:01:52,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:01:52,876 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:52,932 INFO L588 ElimStorePlain]: treesize reduction 69, result has 37.8 percent of original size [2019-11-28 03:01:52,933 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:52,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2019-11-28 03:01:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:53,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-28 03:01:53,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-28 03:01:53,247 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 31 states and 38 transitions. Complement of second has 14 states. [2019-11-28 03:01:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 03:01:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-28 03:01:53,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 03:01:53,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:53,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 03:01:53,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:53,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 03:01:53,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:53,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-28 03:01:53,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:01:53,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2019-11-28 03:01:53,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:01:53,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 03:01:53,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-11-28 03:01:53,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:53,258 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 03:01:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-11-28 03:01:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2019-11-28 03:01:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:01:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 03:01:53,261 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:01:53,261 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:01:53,261 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:01:53,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 03:01:53,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:53,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:53,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:53,263 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:53,263 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:53,264 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 248#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 249#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 250#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 259#L554 assume gcd_#t~mem7 < 0;havoc gcd_#t~mem7;call gcd_#t~mem8 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(-gcd_#t~mem8, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem8; 251#L555-2 [2019-11-28 03:01:53,264 INFO L796 eck$LassoCheckResult]: Loop: 251#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 252#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 261#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 266#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 256#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 251#L555-2 [2019-11-28 03:01:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:53,265 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-11-28 03:01:53,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:53,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30833067] [2019-11-28 03:01:53,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash 46919933, now seen corresponding path program 2 times [2019-11-28 03:01:53,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:53,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608376503] [2019-11-28 03:01:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2042683401, now seen corresponding path program 1 times [2019-11-28 03:01:53,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:53,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420684758] [2019-11-28 03:01:53,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:53,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:53,971 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2019-11-28 03:01:54,091 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 03:01:54,096 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:54,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:54,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:54,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:54,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:54,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:54,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:54,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:54,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration3_Lasso [2019-11-28 03:01:54,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:54,097 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:54,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,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-11-28 03:01:54,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-11-28 03:01:54,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-11-28 03:01:54,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-11-28 03:01:54,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-11-28 03:01:54,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-11-28 03:01:54,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,502 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-28 03:01:54,679 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-28 03:01:54,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,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-11-28 03:01:54,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:54,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:55,310 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:55,312 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,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-11-28 03:01:55,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-11-28 03:01:55,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:55,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:55,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:55,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,598 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 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:55,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:55,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:55,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:55,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:55,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:55,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:55,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:55,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:55,802 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:55,816 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 03:01:55,816 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:55,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:01:55,823 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:01:55,823 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:55,823 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-28 03:01:55,925 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-28 03:01:55,927 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:01:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:55,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:01:55,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:55,991 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:55,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-28 03:01:55,992 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:55,998 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:55,999 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:55,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-28 03:01:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:56,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:01:56,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:56,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:56,064 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 2 case distinctions, treesize of input 30 treesize of output 64 [2019-11-28 03:01:56,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:01:56,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:56,068 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:56,120 INFO L588 ElimStorePlain]: treesize reduction 91, result has 31.6 percent of original size [2019-11-28 03:01:56,120 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:56,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2019-11-28 03:01:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:56,232 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-28 03:01:56,232 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-28 03:01:56,346 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 40 states and 49 transitions. Complement of second has 14 states. [2019-11-28 03:01:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 03:01:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2019-11-28 03:01:56,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-28 03:01:56,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-28 03:01:56,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 03:01:56,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:56,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2019-11-28 03:01:56,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:01:56,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 45 transitions. [2019-11-28 03:01:56,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 03:01:56,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-28 03:01:56,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-28 03:01:56,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:56,353 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-28 03:01:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-28 03:01:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-11-28 03:01:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 03:01:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-28 03:01:56,356 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:01:56,356 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-28 03:01:56,357 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:01:56,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-28 03:01:56,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:56,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:56,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:56,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:56,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:01:56,358 INFO L794 eck$LassoCheckResult]: Stem: 486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 476#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 477#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 485#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 487#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 493#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 484#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 494#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 488#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-11-28 03:01:56,358 INFO L796 eck$LassoCheckResult]: Loop: 489#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 492#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 489#L557-3 [2019-11-28 03:01:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1182880019, now seen corresponding path program 1 times [2019-11-28 03:01:56,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314910341] [2019-11-28 03:01:56,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1894, now seen corresponding path program 1 times [2019-11-28 03:01:56,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974755418] [2019-11-28 03:01:56,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,405 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634248, now seen corresponding path program 2 times [2019-11-28 03:01:56,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:56,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067485164] [2019-11-28 03:01:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:56,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:56,991 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2019-11-28 03:01:57,153 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 03:01:57,156 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:01:57,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:01:57,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:01:57,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:01:57,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:01:57,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:57,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:01:57,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:01:57,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd1-alloca.i_Iteration4_Lasso [2019-11-28 03:01:57,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:01:57,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:01:57,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,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-11-28 03:01:57,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,552 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-11-28 03:01:57,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:57,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:01:58,133 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:01:58,133 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:58,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:58,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:58,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:58,267 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 Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:01:58,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:01:58,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:01:58,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 03:01:58,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:01:58,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:01:58,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:01:58,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:01:58,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:01:58,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:01:58,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:01:58,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:01:58,404 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:01:58,404 INFO L444 ModelExtractionUtils]: 10 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:01:58,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:01:58,411 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:01:58,411 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:01:58,412 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] [2019-11-28 03:01:58,485 INFO L297 tatePredicateManager]: 17 out of 21 supporting invariants were superfluous and have been removed [2019-11-28 03:01:58,494 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:01:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:58,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:01:58,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:58,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2019-11-28 03:01:58,561 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:58,576 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:58,597 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:58,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-28 03:01:58,599 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:58,642 INFO L588 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2019-11-28 03:01:58,644 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:58,644 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:12 [2019-11-28 03:01:58,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:58,726 INFO L343 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-11-28 03:01:58,726 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 2 case distinctions, treesize of input 23 treesize of output 37 [2019-11-28 03:01:58,727 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:58,752 INFO L588 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2019-11-28 03:01:58,753 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 03:01:58,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2019-11-28 03:01:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:58,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 03:01:58,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:58,817 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-11-28 03:01:58,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 03:01:58,926 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 25 states and 32 transitions. Complement of second has 10 states. [2019-11-28 03:01:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:01:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:01:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-28 03:01:58,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 03:01:58,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:58,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-28 03:01:58,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:58,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-28 03:01:58,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:01:58,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-28 03:01:58,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:58,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2019-11-28 03:01:58,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:01:58,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:01:58,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-11-28 03:01:58,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:01:58,935 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 03:01:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-11-28 03:01:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 03:01:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:01:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-28 03:01:58,938 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 03:01:58,938 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-28 03:01:58,938 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:01:58,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-28 03:01:58,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:01:58,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:58,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:58,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:58,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:01:58,940 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 674#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet18;havoc main_#t~nondet18;main_~y~0 := main_#t~nondet19;havoc main_#t~nondet19;gcd_#in~x, gcd_#in~y := main_~x~0, main_~y~0;havoc gcd_#res;havoc gcd_#t~malloc2.base, gcd_#t~malloc2.offset, gcd_#t~malloc3.base, gcd_#t~malloc3.offset, gcd_#t~malloc4.base, gcd_#t~malloc4.offset, gcd_#t~mem5, gcd_#t~mem6, gcd_#t~mem7, gcd_#t~mem8, gcd_#t~mem10, gcd_#t~mem13, gcd_#t~mem14, gcd_#t~mem11, gcd_#t~mem12, gcd_#t~mem15, gcd_#t~mem16, gcd_#t~mem9, gcd_#t~mem17, gcd_~x, gcd_~y, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, gcd_~r~0.base, gcd_~r~0.offset;gcd_~x := gcd_#in~x;gcd_~y := gcd_#in~y;call gcd_#t~malloc2.base, gcd_#t~malloc2.offset := #Ultimate.allocOnStack(4);gcd_~x_ref~0.base, gcd_~x_ref~0.offset := gcd_#t~malloc2.base, gcd_#t~malloc2.offset;call gcd_#t~malloc3.base, gcd_#t~malloc3.offset := #Ultimate.allocOnStack(4);gcd_~y_ref~0.base, gcd_~y_ref~0.offset := gcd_#t~malloc3.base, gcd_#t~malloc3.offset;call gcd_#t~malloc4.base, gcd_#t~malloc4.offset := #Ultimate.allocOnStack(4);gcd_~r~0.base, gcd_~r~0.offset := gcd_#t~malloc4.base, gcd_#t~malloc4.offset;call write~int(gcd_~x, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_~y, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call gcd_#t~mem5 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4); 675#L553 assume !(gcd_#t~mem5 < 0);havoc gcd_#t~mem5; 683#L553-2 call gcd_#t~mem7 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 685#L554 assume !(gcd_#t~mem7 < 0);havoc gcd_#t~mem7; 693#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 682#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 689#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 696#L557-1 assume !!(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12;call gcd_#t~mem13 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem14 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem13 - gcd_#t~mem14, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem13;havoc gcd_#t~mem14; 695#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 686#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2019-11-28 03:01:58,940 INFO L796 eck$LassoCheckResult]: Loop: 676#L557-4 call gcd_#t~mem15 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);call write~int(gcd_#t~mem15, gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);havoc gcd_#t~mem15;call gcd_#t~mem16 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call write~int(gcd_#t~mem16, gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4);havoc gcd_#t~mem16; 677#L555-2 call gcd_#t~mem9 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 680#L555 assume !!(gcd_#t~mem9 > 0);havoc gcd_#t~mem9;call gcd_#t~mem10 := read~int(gcd_~x_ref~0.base, gcd_~x_ref~0.offset, 4);call write~int(gcd_#t~mem10, gcd_~r~0.base, gcd_~r~0.offset, 4);havoc gcd_#t~mem10; 691#L557-3 call gcd_#t~mem11 := read~int(gcd_~r~0.base, gcd_~r~0.offset, 4);call gcd_#t~mem12 := read~int(gcd_~y_ref~0.base, gcd_~y_ref~0.offset, 4); 692#L557-1 assume !(gcd_#t~mem11 >= gcd_#t~mem12);havoc gcd_#t~mem11;havoc gcd_#t~mem12; 676#L557-4 [2019-11-28 03:01:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1418634250, now seen corresponding path program 1 times [2019-11-28 03:01:58,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:58,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086252534] [2019-11-28 03:01:58,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:58,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 64312973, now seen corresponding path program 3 times [2019-11-28 03:01:59,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:59,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088878701] [2019-11-28 03:01:59,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:59,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1038603336, now seen corresponding path program 1 times [2019-11-28 03:01:59,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:59,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796830055] [2019-11-28 03:01:59,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:01:59,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796830055] [2019-11-28 03:01:59,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173172968] [2019-11-28 03:01:59,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:01:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:59,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 03:01:59,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:59,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:59,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 47 [2019-11-28 03:01:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,370 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:01:59,408 INFO L588 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-11-28 03:01:59,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,411 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:01:59,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:45 [2019-11-28 03:01:59,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:59,687 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-28 03:01:59,688 INFO L343 Elim1Store]: treesize reduction 52, result has 62.0 percent of original size [2019-11-28 03:01:59,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 120 [2019-11-28 03:01:59,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:59,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:59,998 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:02:00,002 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 03:02:00,008 INFO L168 Benchmark]: Toolchain (without parser) took 11806.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.8 MB). Free memory was 956.3 MB in the beginning and 1.4 GB in the end (delta: -416.6 MB). Peak memory consumption was 448.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,008 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:00,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:00,014 INFO L168 Benchmark]: Boogie Preprocessor took 30.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,015 INFO L168 Benchmark]: RCFGBuilder took 396.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,019 INFO L168 Benchmark]: BuchiAutomizer took 10710.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -272.8 MB). Peak memory consumption was 448.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:00,026 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 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 396.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10710.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -272.8 MB). Peak memory consumption was 448.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...