./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/reducercommutativity/sep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 2de5f35db1963376882467da4793139d8556584c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:16:55,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:16:55,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:16:55,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:16:55,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:16:55,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:16:55,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:16:55,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:16:55,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:16:55,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:16:55,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:16:55,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:16:55,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:16:55,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:16:55,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:16:55,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:16:55,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:16:55,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:16:55,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:16:55,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:16:55,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:16:55,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:16:55,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:16:55,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:16:55,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:16:55,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:16:55,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:16:55,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:16:55,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:16:55,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:16:55,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:16:55,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:16:55,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:16:55,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:16:55,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:16:55,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:16:55,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:16:55,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:16:55,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:16:55,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:16:55,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:16:55,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:16:55,851 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:16:55,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:16:55,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:16:55,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:16:55,855 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:16:55,855 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:16:55,856 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:16:55,856 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:16:55,856 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:16:55,856 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:16:55,858 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:16:55,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:16:55,858 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:16:55,859 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:16:55,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:16:55,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:16:55,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:16:55,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:16:55,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:16:55,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:16:55,860 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:16:55,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:16:55,861 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:16:55,861 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:16:55,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:16:55,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:16:55,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:16:55,862 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:16:55,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:16:55,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:16:55,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:16:55,863 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:16:55,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:16:55,865 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2de5f35db1963376882467da4793139d8556584c [2020-10-20 08:16:56,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:16:56,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:16:56,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:16:56,099 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:16:56,100 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:16:56,101 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2020-10-20 08:16:56,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b513863/bc95c8004f404450bfc3355c3ae127d7/FLAG0e4c14632 [2020-10-20 08:16:56,781 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:16:56,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2020-10-20 08:16:56,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b513863/bc95c8004f404450bfc3355c3ae127d7/FLAG0e4c14632 [2020-10-20 08:16:57,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b513863/bc95c8004f404450bfc3355c3ae127d7 [2020-10-20 08:16:57,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:16:57,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:16:57,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:57,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:16:57,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:16:57,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a48641a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57, skipping insertion in model container [2020-10-20 08:16:57,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:16:57,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:16:57,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:57,332 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:16:57,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:16:57,383 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:16:57,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57 WrapperNode [2020-10-20 08:16:57,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:16:57,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:57,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:16:57,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:16:57,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:16:57,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:16:57,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:16:57,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:16:57,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (1/1) ... [2020-10-20 08:16:57,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:16:57,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:16:57,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:16:57,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:16:57,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (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 [2020-10-20 08:16:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:16:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:16:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:16:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:16:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:16:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:16:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:16:57,953 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:16:57,953 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-10-20 08:16:57,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:57 BoogieIcfgContainer [2020-10-20 08:16:57,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:16:57,959 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:16:57,959 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:16:57,971 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:16:57,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:57,973 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:16:57" (1/3) ... [2020-10-20 08:16:57,977 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38cacaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:57, skipping insertion in model container [2020-10-20 08:16:57,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:57,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:16:57" (2/3) ... [2020-10-20 08:16:57,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38cacaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:16:57, skipping insertion in model container [2020-10-20 08:16:57,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:16:57,979 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:57" (3/3) ... [2020-10-20 08:16:57,988 INFO L373 chiAutomizerObserver]: Analyzing ICFG sep.i [2020-10-20 08:16:58,048 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:16:58,048 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:16:58,048 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:16:58,049 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:16:58,049 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:16:58,049 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:16:58,050 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:16:58,050 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:16:58,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-20 08:16:58,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:58,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:58,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:58,112 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 08:16:58,113 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:58,113 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:16:58,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-10-20 08:16:58,120 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:16:58,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:16:58,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:16:58,122 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 08:16:58,122 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:16:58,132 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 16#L34true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 6#L20-3true [2020-10-20 08:16:58,133 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 29#L22true assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 7#L20-2true sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 6#L20-3true [2020-10-20 08:16:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-10-20 08:16:58,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521208399] [2020-10-20 08:16:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,317 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,364 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2020-10-20 08:16:58,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708880335] [2020-10-20 08:16:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:16:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2020-10-20 08:16:58,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:16:58,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179366272] [2020-10-20 08:16:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:16:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:16:58,478 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:16:58,485 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:16:59,041 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-10-20 08:16:59,214 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-20 08:16:59,230 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:16:59,231 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:16:59,231 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:16:59,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:16:59,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:16:59,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:16:59,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:16:59,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:16:59,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2020-10-20 08:16:59,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:16:59,234 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:16:59,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,801 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-10-20 08:16:59,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:16:59,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:00,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:00,390 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) [2020-10-20 08:17:00,396 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 [2020-10-20 08:17:00,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,408 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 [2020-10-20 08:17:00,434 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 [2020-10-20 08:17:00,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,443 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 [2020-10-20 08:17:00,467 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 [2020-10-20 08:17:00,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,472 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) [2020-10-20 08:17:00,515 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 [2020-10-20 08:17:00,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,520 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,543 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 [2020-10-20 08:17:00,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:00,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:00,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 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 [2020-10-20 08:17:00,587 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 [2020-10-20 08:17:00,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,592 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 [2020-10-20 08:17:00,620 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 [2020-10-20 08:17:00,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,630 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 [2020-10-20 08:17:00,666 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 [2020-10-20 08:17:00,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,671 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) [2020-10-20 08:17:00,718 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,726 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 [2020-10-20 08:17:00,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:00,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:00,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:00,770 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 [2020-10-20 08:17:00,816 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 [2020-10-20 08:17:00,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,821 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) [2020-10-20 08:17:00,876 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 [2020-10-20 08:17:00,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:00,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,888 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 [2020-10-20 08:17:00,921 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 [2020-10-20 08:17:00,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:00,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:00,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:00,928 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,955 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 [2020-10-20 08:17:00,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:00,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:00,967 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:00,994 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 [2020-10-20 08:17:00,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:00,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:00,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:00,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:00,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:00,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:01,003 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:01,036 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 [2020-10-20 08:17:01,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:01,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:01,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:01,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:01,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:01,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:01,064 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:01,109 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 08:17:01,109 INFO L444 ModelExtractionUtils]: 13 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:01,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:01,124 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:01,124 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:01,126 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-20 08:17:01,354 INFO L297 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2020-10-20 08:17:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:01,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:01,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:01,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:01,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:01,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:17:01,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2020-10-20 08:17:01,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 59 states and 85 transitions. Complement of second has 8 states. [2020-10-20 08:17:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2020-10-20 08:17:01,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 3 letters. [2020-10-20 08:17:01,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:01,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 6 letters. Loop has 3 letters. [2020-10-20 08:17:01,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:01,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 3 letters. Loop has 6 letters. [2020-10-20 08:17:01,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:01,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 85 transitions. [2020-10-20 08:17:01,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:01,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 20 states and 29 transitions. [2020-10-20 08:17:01,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:17:01,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:01,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-10-20 08:17:01,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:01,619 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-10-20 08:17:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-20 08:17:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:17:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-10-20 08:17:01,657 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:01,657 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-10-20 08:17:01,657 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:17:01,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-10-20 08:17:01,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:01,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:01,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:01,661 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:01,662 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:01,662 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 299#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 300#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 290#L20-3 assume !(sep_~i~0 < ~N~0); 287#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 288#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 289#L20-8 [2020-10-20 08:17:01,662 INFO L796 eck$LassoCheckResult]: Loop: 289#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 297#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 298#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 289#L20-8 [2020-10-20 08:17:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2020-10-20 08:17:01,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:01,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149065433] [2020-10-20 08:17:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:01,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149065433] [2020-10-20 08:17:01,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:01,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:17:01,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853491687] [2020-10-20 08:17:01,760 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2020-10-20 08:17:01,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:01,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369874365] [2020-10-20 08:17:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:01,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:01,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:01,781 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:01,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:17:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:17:01,854 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 08:17:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:01,889 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2020-10-20 08:17:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:17:01,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2020-10-20 08:17:01,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:01,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2020-10-20 08:17:01,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:01,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:01,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2020-10-20 08:17:01,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:01,893 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-10-20 08:17:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2020-10-20 08:17:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-10-20 08:17:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:17:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2020-10-20 08:17:01,896 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:17:01,896 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:17:01,896 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:17:01,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-10-20 08:17:01,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:01,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:01,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:01,898 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:01,898 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:01,898 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 347#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 348#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 338#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 339#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 343#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 340#L20-3 assume !(sep_~i~0 < ~N~0); 335#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 336#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 337#L20-8 [2020-10-20 08:17:01,898 INFO L796 eck$LassoCheckResult]: Loop: 337#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 345#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 346#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 337#L20-8 [2020-10-20 08:17:01,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2020-10-20 08:17:01,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:01,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319389241] [2020-10-20 08:17:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:01,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319389241] [2020-10-20 08:17:01,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632253002] [2020-10-20 08:17:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:02,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:02,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:02,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:02,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-20 08:17:02,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443922699] [2020-10-20 08:17:02,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2020-10-20 08:17:02,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:02,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918036382] [2020-10-20 08:17:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,149 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:02,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:17:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:17:02,217 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-10-20 08:17:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:02,269 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-10-20 08:17:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:17:02,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-10-20 08:17:02,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:02,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2020-10-20 08:17:02,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:02,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:02,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-10-20 08:17:02,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:02,272 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-20 08:17:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-10-20 08:17:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-20 08:17:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 08:17:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-10-20 08:17:02,275 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-20 08:17:02,275 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-10-20 08:17:02,275 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:17:02,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-10-20 08:17:02,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:02,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:02,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:02,277 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:02,277 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:02,277 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 426#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 427#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 416#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 417#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 422#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 418#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 419#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 432#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 433#L20-3 assume !(sep_~i~0 < ~N~0); 413#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 414#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 415#L20-8 [2020-10-20 08:17:02,277 INFO L796 eck$LassoCheckResult]: Loop: 415#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 424#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 425#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 415#L20-8 [2020-10-20 08:17:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2020-10-20 08:17:02,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:02,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552038875] [2020-10-20 08:17:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:02,402 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2020-10-20 08:17:02,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:02,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806872005] [2020-10-20 08:17:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:02,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:02,449 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2020-10-20 08:17:02,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:02,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586763435] [2020-10-20 08:17:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:02,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586763435] [2020-10-20 08:17:02,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536980086] [2020-10-20 08:17:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:02,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:17:02,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:03,037 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-20 08:17:03,039 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2020-10-20 08:17:03,041 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:03,052 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:03,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:03,055 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2020-10-20 08:17:03,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2020-10-20 08:17:03,094 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:03,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:03,097 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:03,097 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:6 [2020-10-20 08:17:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:03,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:03,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-20 08:17:03,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374562116] [2020-10-20 08:17:03,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:17:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-10-20 08:17:03,191 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 13 states. [2020-10-20 08:17:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:04,034 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2020-10-20 08:17:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 08:17:04,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2020-10-20 08:17:04,039 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28 [2020-10-20 08:17:04,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 135 transitions. [2020-10-20 08:17:04,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-20 08:17:04,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-20 08:17:04,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 135 transitions. [2020-10-20 08:17:04,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:04,045 INFO L691 BuchiCegarLoop]: Abstraction has 101 states and 135 transitions. [2020-10-20 08:17:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 135 transitions. [2020-10-20 08:17:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 31. [2020-10-20 08:17:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 08:17:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 08:17:04,052 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:17:04,052 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 08:17:04,052 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:17:04,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2020-10-20 08:17:04,054 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-10-20 08:17:04,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:04,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:04,055 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:04,055 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:04,055 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 626#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 627#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 615#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 616#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 634#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 617#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 618#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 639#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 637#L20-3 assume !(sep_~i~0 < ~N~0); 636#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 613#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 614#L20-8 [2020-10-20 08:17:04,055 INFO L796 eck$LassoCheckResult]: Loop: 614#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 633#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 625#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 614#L20-8 [2020-10-20 08:17:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2020-10-20 08:17:04,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:04,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265126446] [2020-10-20 08:17:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2020-10-20 08:17:04,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:04,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908120934] [2020-10-20 08:17:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,111 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2020-10-20 08:17:04,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:04,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135143641] [2020-10-20 08:17:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:04,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:04,175 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:05,148 WARN L193 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 178 [2020-10-20 08:17:05,514 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114 [2020-10-20 08:17:05,517 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:05,517 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:05,517 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:05,517 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:05,517 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:05,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:05,518 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:05,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:05,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2020-10-20 08:17:05,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:05,518 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:05,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:05,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:06,160 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-10-20 08:17:06,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:06,746 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:06,746 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:06,757 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 [2020-10-20 08:17:06,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:06,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:06,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:06,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-10-20 08:17:06,822 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 [2020-10-20 08:17:06,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:06,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:06,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:06,831 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:06,857 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 [2020-10-20 08:17:06,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:06,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:06,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:06,861 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:06,885 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 [2020-10-20 08:17:06,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:06,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:06,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:06,891 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 [2020-10-20 08:17:06,914 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 [2020-10-20 08:17:06,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:06,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:06,923 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) [2020-10-20 08:17:06,963 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 [2020-10-20 08:17:06,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:06,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:06,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:06,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:06,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:06,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:06,971 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 [2020-10-20 08:17:07,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:07,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,006 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,030 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 [2020-10-20 08:17:07,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,034 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) [2020-10-20 08:17:07,058 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 [2020-10-20 08:17:07,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:07,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,096 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,119 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 [2020-10-20 08:17:07,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,123 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,147 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 [2020-10-20 08:17:07,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,151 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,174 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 [2020-10-20 08:17:07,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,180 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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,205 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 [2020-10-20 08:17:07,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,208 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 [2020-10-20 08:17:07,233 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 [2020-10-20 08:17:07,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,237 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) [2020-10-20 08:17:07,259 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 [2020-10-20 08:17:07,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,261 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 [2020-10-20 08:17:07,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,262 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 [2020-10-20 08:17:07,290 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 [2020-10-20 08:17:07,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,295 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 [2020-10-20 08:17:07,317 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 [2020-10-20 08:17:07,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,321 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,345 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 [2020-10-20 08:17:07,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,348 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 [2020-10-20 08:17:07,370 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 [2020-10-20 08:17:07,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,374 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 [2020-10-20 08:17:07,397 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 [2020-10-20 08:17:07,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,404 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) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:07,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,436 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 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 [2020-10-20 08:17:07,457 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 [2020-10-20 08:17:07,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,464 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 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 [2020-10-20 08:17:07,488 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 [2020-10-20 08:17:07,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:07,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:07,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:07,498 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 [2020-10-20 08:17:07,522 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 [2020-10-20 08:17:07,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,527 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 [2020-10-20 08:17:07,552 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 [2020-10-20 08:17:07,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,570 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) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,592 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 [2020-10-20 08:17:07,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,608 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 [2020-10-20 08:17:07,639 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 [2020-10-20 08:17:07,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,645 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) [2020-10-20 08:17:07,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:07,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:07,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:07,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:07,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:07,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:07,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:07,739 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 08:17:07,739 INFO L444 ModelExtractionUtils]: 4 out of 31 variables were initially zero. Simplification set additionally 23 variables to zero. 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) [2020-10-20 08:17:07,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:07,754 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:07,755 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:07,755 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sep_~x.offset, v_rep(select #length ULTIMATE.start_sep_~x.base)_2, ULTIMATE.start_sep_~i~0) = -1*ULTIMATE.start_sep_~x.offset + 1*v_rep(select #length ULTIMATE.start_sep_~x.base)_2 - 4*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-20 08:17:08,008 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2020-10-20 08:17:08,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:08,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:08,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:08,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:17:08,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-10-20 08:17:08,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 40 states and 58 transitions. Complement of second has 7 states. [2020-10-20 08:17:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-10-20 08:17:08,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2020-10-20 08:17:08,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:08,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2020-10-20 08:17:08,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:08,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2020-10-20 08:17:08,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:08,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2020-10-20 08:17:08,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2020-10-20 08:17:08,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:08,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:17:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2020-10-20 08:17:08,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:08,131 INFO L691 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-20 08:17:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2020-10-20 08:17:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-20 08:17:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 08:17:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-10-20 08:17:08,134 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-20 08:17:08,149 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-10-20 08:17:08,149 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:17:08,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-10-20 08:17:08,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:08,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:08,154 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:08,157 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:08,157 INFO L794 eck$LassoCheckResult]: Stem: 988#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 985#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 986#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 975#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 976#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 982#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 977#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 978#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 997#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 995#L20-3 assume !(sep_~i~0 < ~N~0); 994#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 973#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 974#L20-8 assume !(sep_~i~0 < ~N~0); 989#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 969#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 970#L46-3 [2020-10-20 08:17:08,157 INFO L796 eck$LassoCheckResult]: Loop: 970#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 990#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 970#L46-3 [2020-10-20 08:17:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2020-10-20 08:17:08,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:08,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604079460] [2020-10-20 08:17:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:17:08,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604079460] [2020-10-20 08:17:08,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:08,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:08,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567882145] [2020-10-20 08:17:08,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2020-10-20 08:17:08,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:08,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339199092] [2020-10-20 08:17:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:08,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:08,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:08,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:08,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:08,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:17:08,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:17:08,310 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 4 states. [2020-10-20 08:17:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:08,345 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2020-10-20 08:17:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:08,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2020-10-20 08:17:08,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2020-10-20 08:17:08,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 08:17:08,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 08:17:08,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2020-10-20 08:17:08,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:08,348 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2020-10-20 08:17:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2020-10-20 08:17:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-10-20 08:17:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 08:17:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-10-20 08:17:08,353 INFO L714 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 08:17:08,353 INFO L594 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-10-20 08:17:08,353 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:17:08,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-10-20 08:17:08,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:08,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:08,357 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:08,357 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:08,359 INFO L794 eck$LassoCheckResult]: Stem: 1063#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1060#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1061#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1050#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1051#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1057#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1052#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1053#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1067#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1075#L20-3 assume !(sep_~i~0 < ~N~0); 1047#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1048#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1049#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1068#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1059#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1069#L20-8 assume !(sep_~i~0 < ~N~0); 1064#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1045#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 1046#L46-3 [2020-10-20 08:17:08,359 INFO L796 eck$LassoCheckResult]: Loop: 1046#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1065#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1046#L46-3 [2020-10-20 08:17:08,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2020-10-20 08:17:08,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:08,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101900678] [2020-10-20 08:17:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:17:08,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101900678] [2020-10-20 08:17:08,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325776717] [2020-10-20 08:17:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:08,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:17:08,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:08,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-20 08:17:08,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164113032] [2020-10-20 08:17:08,524 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2020-10-20 08:17:08,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:08,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065108886] [2020-10-20 08:17:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:08,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:08,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:08,533 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:08,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:08,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 08:17:08,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-20 08:17:08,589 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-20 08:17:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:08,680 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2020-10-20 08:17:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:17:08,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2020-10-20 08:17:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2020-10-20 08:17:08,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 08:17:08,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-20 08:17:08,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2020-10-20 08:17:08,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:08,684 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2020-10-20 08:17:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2020-10-20 08:17:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-10-20 08:17:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 08:17:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-10-20 08:17:08,688 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-20 08:17:08,688 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-10-20 08:17:08,688 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:17:08,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2020-10-20 08:17:08,689 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:08,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:08,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:08,690 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:08,690 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:08,691 INFO L794 eck$LassoCheckResult]: Stem: 1204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1201#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1202#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1190#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1191#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1215#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1192#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1193#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1208#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1219#L20-3 assume !(sep_~i~0 < ~N~0); 1218#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1217#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1216#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1214#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1211#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1210#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1199#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1200#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1212#L20-8 assume !(sep_~i~0 < ~N~0); 1205#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1185#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 1186#L46-3 [2020-10-20 08:17:08,691 INFO L796 eck$LassoCheckResult]: Loop: 1186#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1206#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1186#L46-3 [2020-10-20 08:17:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2020-10-20 08:17:08,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:08,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805495796] [2020-10-20 08:17:08,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:17:08,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805495796] [2020-10-20 08:17:08,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564534688] [2020-10-20 08:17:08,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:09,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:09,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 08:17:09,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:09,177 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-20 08:17:09,178 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2020-10-20 08:17:09,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:09,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:09,188 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:09,188 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2020-10-20 08:17:09,227 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-10-20 08:17:09,227 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:09,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:09,230 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:09,231 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-10-20 08:17:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 08:17:09,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:09,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-20 08:17:09,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508713345] [2020-10-20 08:17:09,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2020-10-20 08:17:09,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:09,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898372858] [2020-10-20 08:17:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,262 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:09,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 08:17:09,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-10-20 08:17:09,318 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand 13 states. [2020-10-20 08:17:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:09,831 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2020-10-20 08:17:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 08:17:09,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 103 transitions. [2020-10-20 08:17:09,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-10-20 08:17:09,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 103 transitions. [2020-10-20 08:17:09,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2020-10-20 08:17:09,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2020-10-20 08:17:09,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 103 transitions. [2020-10-20 08:17:09,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:09,836 INFO L691 BuchiCegarLoop]: Abstraction has 79 states and 103 transitions. [2020-10-20 08:17:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 103 transitions. [2020-10-20 08:17:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 35. [2020-10-20 08:17:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 08:17:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 08:17:09,842 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 08:17:09,843 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 08:17:09,843 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:17:09,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-20 08:17:09,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-10-20 08:17:09,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:09,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:09,845 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:09,845 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:09,845 INFO L794 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1403#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1404#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1393#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1394#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1399#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1395#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1396#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1421#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1415#L20-3 assume !(sep_~i~0 < ~N~0); 1416#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1391#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1392#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1420#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1414#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1413#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1401#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1402#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1419#L20-8 assume !(sep_~i~0 < ~N~0); 1407#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1387#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 1388#L46-3 [2020-10-20 08:17:09,845 INFO L796 eck$LassoCheckResult]: Loop: 1388#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1408#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1388#L46-3 [2020-10-20 08:17:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2020-10-20 08:17:09,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:09,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547417892] [2020-10-20 08:17:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2020-10-20 08:17:09,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:09,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688063435] [2020-10-20 08:17:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:09,931 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2020-10-20 08:17:09,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:09,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674663609] [2020-10-20 08:17:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:09,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:10,043 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:10,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:11,555 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 276 DAG size of output: 223 [2020-10-20 08:17:12,064 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 132 [2020-10-20 08:17:12,069 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:12,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:12,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:12,070 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:12,070 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:12,070 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:12,070 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:12,070 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:12,070 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration9_Lasso [2020-10-20 08:17:12,070 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:12,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:12,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:12,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,044 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2020-10-20 08:17:13,243 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2020-10-20 08:17:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:13,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:14,007 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:14,008 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 08:17:14,016 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 [2020-10-20 08:17:14,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:14,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:14,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,021 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 [2020-10-20 08:17:14,045 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 [2020-10-20 08:17:14,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:14,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:14,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:14,050 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) [2020-10-20 08:17:14,091 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 [2020-10-20 08:17:14,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:14,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:14,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,099 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) [2020-10-20 08:17:14,134 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:14,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,142 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) [2020-10-20 08:17:14,165 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 [2020-10-20 08:17:14,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:14,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:14,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:14,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:14,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:14,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:14,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:14,252 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-20 08:17:14,252 INFO L444 ModelExtractionUtils]: 1 out of 34 variables were initially zero. Simplification set additionally 30 variables to zero. 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 [2020-10-20 08:17:14,255 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:14,257 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:14,257 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:14,257 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2020-10-20 08:17:14,662 INFO L297 tatePredicateManager]: 76 out of 76 supporting invariants were superfluous and have been removed [2020-10-20 08:17:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:14,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:14,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:14,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:17:14,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-20 08:17:14,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 41 states and 56 transitions. Complement of second has 6 states. [2020-10-20 08:17:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2020-10-20 08:17:14,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 2 letters. [2020-10-20 08:17:14,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 23 letters. Loop has 2 letters. [2020-10-20 08:17:14,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 4 letters. [2020-10-20 08:17:14,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:14,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 56 transitions. [2020-10-20 08:17:14,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:14,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 47 transitions. [2020-10-20 08:17:14,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 08:17:14,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:14,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2020-10-20 08:17:14,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:14,765 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 08:17:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2020-10-20 08:17:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-20 08:17:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 08:17:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2020-10-20 08:17:14,773 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 08:17:14,773 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 08:17:14,774 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:17:14,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-10-20 08:17:14,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:14,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:14,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:14,776 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:14,776 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:14,776 INFO L794 eck$LassoCheckResult]: Stem: 1878#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1875#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1876#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1864#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1865#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1893#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1866#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1867#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1894#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1891#L20-3 assume !(sep_~i~0 < ~N~0); 1890#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1889#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1888#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1887#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1874#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1883#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1884#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1886#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1885#L20-8 assume !(sep_~i~0 < ~N~0); 1879#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1859#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 1860#L46-3 assume !(main_~i~1 < ~N~0 - 1); 1877#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1868#L20-13 [2020-10-20 08:17:14,777 INFO L796 eck$LassoCheckResult]: Loop: 1868#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1869#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1870#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1868#L20-13 [2020-10-20 08:17:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -484677821, now seen corresponding path program 1 times [2020-10-20 08:17:14,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163083862] [2020-10-20 08:17:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 08:17:14,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163083862] [2020-10-20 08:17:14,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:14,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:14,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8641537] [2020-10-20 08:17:14,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 1 times [2020-10-20 08:17:14,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932857324] [2020-10-20 08:17:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:14,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:14,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:14,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:14,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:17:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:17:14,930 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-20 08:17:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:14,959 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2020-10-20 08:17:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:14,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2020-10-20 08:17:14,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:14,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2020-10-20 08:17:14,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 08:17:14,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 08:17:14,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2020-10-20 08:17:14,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:14,963 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2020-10-20 08:17:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2020-10-20 08:17:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-10-20 08:17:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 08:17:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-10-20 08:17:14,965 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-20 08:17:14,965 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-10-20 08:17:14,966 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:17:14,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-10-20 08:17:14,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:14,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:14,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:14,967 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:14,967 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:14,967 INFO L794 eck$LassoCheckResult]: Stem: 1957#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 1954#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 1955#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1944#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1945#L22 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1951#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1946#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1947#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1974#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1971#L20-3 assume !(sep_~i~0 < ~N~0); 1941#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1942#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1943#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1961#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1963#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1962#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1952#L22-2 assume !(0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2));havoc sep_#t~mem4;sep_#t~post6 := sep_~ret~0;sep_~ret~0 := sep_#t~post6 - 1;havoc sep_#t~post6; 1953#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1964#L20-8 assume !(sep_~i~0 < ~N~0); 1958#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 1939#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 1940#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 1959#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 1960#L46-3 assume !(main_~i~1 < ~N~0 - 1); 1956#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 1948#L20-13 [2020-10-20 08:17:14,967 INFO L796 eck$LassoCheckResult]: Loop: 1948#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 1949#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 1950#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 1948#L20-13 [2020-10-20 08:17:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860571, now seen corresponding path program 1 times [2020-10-20 08:17:14,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:14,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608326812] [2020-10-20 08:17:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:14,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 2 times [2020-10-20 08:17:15,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114157424] [2020-10-20 08:17:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:15,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:15,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:15,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:15,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1239507716, now seen corresponding path program 1 times [2020-10-20 08:17:15,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:15,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342257123] [2020-10-20 08:17:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:17:15,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342257123] [2020-10-20 08:17:15,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501440339] [2020-10-20 08:17:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:15,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-20 08:17:15,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:15,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 08:17:15,951 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2020-10-20 08:17:15,954 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:15,966 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:15,969 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:15,969 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2020-10-20 08:17:16,166 INFO L350 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2020-10-20 08:17:16,167 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2020-10-20 08:17:16,168 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:16,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:16,176 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:16,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2020-10-20 08:17:16,284 INFO L350 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2020-10-20 08:17:16,285 INFO L384 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 3 case distinctions, treesize of input 42 treesize of output 96 [2020-10-20 08:17:16,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:16,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:16,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:16,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:16,302 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 08:17:16,356 INFO L625 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size [2020-10-20 08:17:16,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 08:17:16,366 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:16,367 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:66 [2020-10-20 08:17:16,450 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-10-20 08:17:16,451 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:16,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:16,456 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:16,457 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:15 [2020-10-20 08:17:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:17:16,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:16,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2020-10-20 08:17:16,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767564769] [2020-10-20 08:17:16,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 08:17:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-10-20 08:17:16,556 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand 22 states. [2020-10-20 08:17:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:19,342 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-10-20 08:17:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-20 08:17:19,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 149 transitions. [2020-10-20 08:17:19,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-10-20 08:17:19,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 149 transitions. [2020-10-20 08:17:19,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 08:17:19,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 08:17:19,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 149 transitions. [2020-10-20 08:17:19,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:19,352 INFO L691 BuchiCegarLoop]: Abstraction has 118 states and 149 transitions. [2020-10-20 08:17:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 149 transitions. [2020-10-20 08:17:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 70. [2020-10-20 08:17:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 08:17:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2020-10-20 08:17:19,363 INFO L714 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-20 08:17:19,364 INFO L594 BuchiCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-10-20 08:17:19,364 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:17:19,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 90 transitions. [2020-10-20 08:17:19,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:19,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:19,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:19,366 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:19,367 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:19,367 INFO L794 eck$LassoCheckResult]: Stem: 2265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(6);call write~init~int(115, #t~string1.base, #t~string1.offset, 1);call write~init~int(101, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(112, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(46, #t~string1.base, 3 + #t~string1.offset, 1);call write~init~int(99, #t~string1.base, 4 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 5 + #t~string1.offset, 1);~N~0 := 0; 2262#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~mem9, main_#t~mem10, main_#t~ret11, main_#t~mem12, main_#t~mem14, main_#t~post13, main_~i~1, main_#t~ret15, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; 2263#L34 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2251#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2252#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2257#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2253#L20-3 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2254#L22 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2297#L20-2 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2280#L20-3 assume !(sep_~i~0 < ~N~0); 2281#L20-4 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2249#L27 main_#t~ret8 := sep_#res;main_~ret~1 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem10;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2250#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2288#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2289#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2276#L20-8 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2277#L22-2 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2287#L20-7 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2285#L20-8 assume !(sep_~i~0 < ~N~0); 2266#L20-9 sep_#res := (if sep_~ret~0 % 4294967296 <= 2147483647 then sep_~ret~0 % 4294967296 else sep_~ret~0 % 4294967296 - 4294967296); 2267#L27-1 main_#t~ret11 := sep_#res;main_~ret2~0 := main_#t~ret11;havoc main_#t~ret11;call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem12;havoc main_#t~mem12;main_~i~1 := 0; 2311#L46-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem14 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem14, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem14; 2310#L46-2 main_#t~post13 := main_~i~1;main_~i~1 := 1 + main_#t~post13;havoc main_#t~post13; 2309#L46-3 assume !(main_~i~1 < ~N~0 - 1); 2264#L46-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sep_#in~x.base, sep_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sep_#res;havoc sep_#t~mem4, sep_#t~post5, sep_#t~post6, sep_#t~post3, sep_~i~0, sep_~x.base, sep_~x.offset, sep_~ret~0;sep_~x.base, sep_~x.offset := sep_#in~x.base, sep_#in~x.offset;sep_~ret~0 := 0;sep_~i~0 := 0; 2255#L20-13 [2020-10-20 08:17:19,367 INFO L796 eck$LassoCheckResult]: Loop: 2255#L20-13 assume !!(sep_~i~0 < ~N~0);call sep_#t~mem4 := read~int(sep_~x.base, sep_~x.offset + 4 * sep_~i~0, 4); 2256#L22-4 assume 0 == (if sep_#t~mem4 < 0 && 0 != sep_#t~mem4 % 2 then sep_#t~mem4 % 2 - 2 else sep_#t~mem4 % 2);havoc sep_#t~mem4;sep_#t~post5 := sep_~ret~0;sep_~ret~0 := 1 + sep_#t~post5;havoc sep_#t~post5; 2259#L20-12 sep_#t~post3 := sep_~i~0;sep_~i~0 := 1 + sep_#t~post3;havoc sep_#t~post3; 2255#L20-13 [2020-10-20 08:17:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1273346529, now seen corresponding path program 1 times [2020-10-20 08:17:19,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80945504] [2020-10-20 08:17:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 98408, now seen corresponding path program 3 times [2020-10-20 08:17:19,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261657931] [2020-10-20 08:17:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,453 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1115355784, now seen corresponding path program 1 times [2020-10-20 08:17:19,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:19,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793000766] [2020-10-20 08:17:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:19,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:19,547 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:21,441 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 321 DAG size of output: 253 [2020-10-20 08:17:21,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 08:17:21,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 08:17:21,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 08:17:21,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 08:17:22,520 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 231 DAG size of output: 144 [2020-10-20 08:17:22,523 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:22,523 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:22,523 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:22,523 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:22,523 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:22,523 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:22,524 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:22,524 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:22,524 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration12_Lasso [2020-10-20 08:17:22,524 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:22,524 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:22,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:22,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,317 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2020-10-20 08:17:23,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:23,746 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-20 08:17:24,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:24,091 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,102 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 [2020-10-20 08:17:24,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,105 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,129 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 [2020-10-20 08:17:24,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,132 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:24,156 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,160 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,183 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 [2020-10-20 08:17:24,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,190 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,224 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 [2020-10-20 08:17:24,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,230 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,253 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 [2020-10-20 08:17:24,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,261 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,284 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 [2020-10-20 08:17:24,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,287 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,310 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 [2020-10-20 08:17:24,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,314 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,338 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 [2020-10-20 08:17:24,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,343 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,367 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 [2020-10-20 08:17:24,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,370 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,393 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 [2020-10-20 08:17:24,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,401 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,426 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 [2020-10-20 08:17:24,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,432 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,457 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 [2020-10-20 08:17:24,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,460 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,483 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 [2020-10-20 08:17:24,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,487 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,510 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 [2020-10-20 08:17:24,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,514 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,537 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 [2020-10-20 08:17:24,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,544 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,568 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 [2020-10-20 08:17:24,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,573 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,597 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 [2020-10-20 08:17:24,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,604 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,626 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 [2020-10-20 08:17:24,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,639 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,664 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 [2020-10-20 08:17:24,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:24,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:24,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:24,668 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,691 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 [2020-10-20 08:17:24,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,699 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,721 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 [2020-10-20 08:17:24,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,751 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 [2020-10-20 08:17:24,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,766 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,800 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 [2020-10-20 08:17:24,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:24,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:24,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:24,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:24,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:24,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:24,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:24,884 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2020-10-20 08:17:24,884 INFO L444 ModelExtractionUtils]: 5 out of 34 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:24,887 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:24,889 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:24,890 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:24,890 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0 Supporting invariants [] [2020-10-20 08:17:25,178 INFO L297 tatePredicateManager]: 57 out of 57 supporting invariants were superfluous and have been removed [2020-10-20 08:17:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:25,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:25,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:25,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:25,263 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:17:25,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 90 transitions. cyclomatic complexity: 28 Second operand 3 states. [2020-10-20 08:17:25,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 90 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 74 states and 97 transitions. Complement of second has 4 states. [2020-10-20 08:17:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2020-10-20 08:17:25,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2020-10-20 08:17:25,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:25,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 28 letters. Loop has 3 letters. [2020-10-20 08:17:25,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:25,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 25 letters. Loop has 6 letters. [2020-10-20 08:17:25,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:25,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2020-10-20 08:17:25,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:17:25,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2020-10-20 08:17:25,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:17:25,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:17:25,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:17:25,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:25,284 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:25,284 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:25,284 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:17:25,284 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:17:25,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:17:25,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:17:25,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:17:25,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:17:25 BoogieIcfgContainer [2020-10-20 08:17:25,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:17:25,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:17:25,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:17:25,295 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:17:25,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:16:57" (3/4) ... [2020-10-20 08:17:25,298 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:17:25,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:17:25,299 INFO L168 Benchmark]: Toolchain (without parser) took 28240.82 ms. Allocated memory was 43.0 MB in the beginning and 144.7 MB in the end (delta: 101.7 MB). Free memory was 23.8 MB in the beginning and 64.7 MB in the end (delta: -40.9 MB). Peak memory consumption was 60.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,300 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 32.5 MB. Free memory was 10.8 MB in the beginning and 10.8 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.43 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 23.0 MB in the beginning and 24.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 43.5 MB. Free memory was 24.6 MB in the beginning and 22.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,301 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 43.5 MB. Free memory was 22.6 MB in the beginning and 20.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,301 INFO L168 Benchmark]: RCFGBuilder took 494.23 ms. Allocated memory was 43.5 MB in the beginning and 46.1 MB in the end (delta: 2.6 MB). Free memory was 20.9 MB in the beginning and 20.8 MB in the end (delta: 131.6 kB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,301 INFO L168 Benchmark]: BuchiAutomizer took 27335.64 ms. Allocated memory was 46.1 MB in the beginning and 144.7 MB in the end (delta: 98.6 MB). Free memory was 20.6 MB in the beginning and 66.5 MB in the end (delta: -46.0 MB). Peak memory consumption was 52.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:25,302 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 144.7 MB. Free memory is still 64.7 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:17:25,304 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 32.5 MB. Free memory was 10.8 MB in the beginning and 10.8 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 316.43 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 23.0 MB in the beginning and 24.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 46.60 ms. Allocated memory is still 43.5 MB. Free memory was 24.6 MB in the beginning and 22.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 43.5 MB. Free memory was 22.6 MB in the beginning and 20.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 494.23 ms. Allocated memory was 43.5 MB in the beginning and 46.1 MB in the end (delta: 2.6 MB). Free memory was 20.9 MB in the beginning and 20.8 MB in the end (delta: 131.6 kB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 27335.64 ms. Allocated memory was 46.1 MB in the beginning and 144.7 MB in the end (delta: 98.6 MB). Free memory was 20.6 MB in the beginning and 66.5 MB in the end (delta: -46.0 MB). Peak memory consumption was 52.6 MB. Max. memory is 14.3 GB. * Witness Printer took 3.76 ms. Allocated memory is still 144.7 MB. Free memory is still 64.7 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * x + unknown-#length-unknown[x] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.2s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 21.9s. Construction of modules took 2.0s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 242 SDtfs, 464 SDslu, 618 SDs, 0 SdLazy, 2032 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital310 mio100 ax100 hnf99 lsp94 ukn58 mio100 lsp53 div100 bol100 ite100 ukn100 eq179 hnf89 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...