./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Parts.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e8d55036 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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 23:14:30,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:14:30,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:14:30,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:14:30,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:14:30,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:14:30,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:14:30,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:14:30,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:14:30,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:14:30,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:14:30,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:14:30,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:14:30,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:14:30,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:14:30,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:14:30,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:14:30,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:14:30,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:14:30,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:14:30,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:14:30,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:14:30,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:14:30,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:14:30,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:14:30,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:14:30,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:14:30,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:14:30,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:14:30,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:14:30,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:14:30,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:14:30,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:14:30,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:14:30,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:14:30,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:14:30,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:14:30,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:14:30,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:14:30,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:14:30,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:14:30,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 23:14:30,223 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:14:30,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:14:30,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:14:30,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:14:30,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:14:30,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:14:30,225 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:14:30,226 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 23:14:30,226 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 23:14:30,226 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 23:14:30,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:14:30,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 23:14:30,228 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:14:30,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 23:14:30,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:14:30,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:14:30,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:14:30,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:14:30,230 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 23:14:30,230 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2023-02-15 23:14:30,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:14:30,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:14:30,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:14:30,473 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:14:30,473 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:14:30,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2023-02-15 23:14:31,435 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:14:31,577 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:14:31,578 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2023-02-15 23:14:31,582 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd5dff5e/c0e067682fd34663be293a130c4f1bdd/FLAG28a3a6121 [2023-02-15 23:14:31,590 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd5dff5e/c0e067682fd34663be293a130c4f1bdd [2023-02-15 23:14:31,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:14:31,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:14:31,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:14:31,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:14:31,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:14:31,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5402937f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31, skipping insertion in model container [2023-02-15 23:14:31,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:14:31,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:14:31,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:14:31,691 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:14:31,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:14:31,707 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:14:31,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31 WrapperNode [2023-02-15 23:14:31,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:14:31,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:14:31,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:14:31,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:14:31,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,726 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-15 23:14:31,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:14:31,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:14:31,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:14:31,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:14:31,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,737 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:14:31,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:14:31,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:14:31,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:14:31,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (1/1) ... [2023-02-15 23:14:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:31,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:31,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-02-15 23:14:31,825 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2023-02-15 23:14:31,826 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2023-02-15 23:14:31,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:14:31,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:14:31,865 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:14:31,866 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:14:31,982 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:14:31,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:14:31,995 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 23:14:32,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:14:32 BoogieIcfgContainer [2023-02-15 23:14:32,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:14:32,010 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 23:14:32,010 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 23:14:32,013 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 23:14:32,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:32,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 11:14:31" (1/3) ... [2023-02-15 23:14:32,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aad62d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:14:32, skipping insertion in model container [2023-02-15 23:14:32,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:32,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:14:31" (2/3) ... [2023-02-15 23:14:32,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aad62d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 11:14:32, skipping insertion in model container [2023-02-15 23:14:32,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 23:14:32,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:14:32" (3/3) ... [2023-02-15 23:14:32,016 INFO L332 chiAutomizerObserver]: Analyzing ICFG Parts.c [2023-02-15 23:14:32,054 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 23:14:32,055 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 23:14:32,055 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 23:14:32,055 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 23:14:32,055 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 23:14:32,055 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 23:14:32,055 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 23:14:32,056 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 23:14:32,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 23:14:32,072 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 23:14:32,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:32,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:32,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:32,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:32,076 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 23:14:32,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 23:14:32,089 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 23:14:32,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:32,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:32,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:32,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:32,109 INFO L748 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 17#L28true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6#L31true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 25#L34-3true [2023-02-15 23:14:32,110 INFO L750 eck$LassoCheckResult]: Loop: 25#L34-3true assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 11#L35-3true assume !true; 10#L34-2true main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 25#L34-3true [2023-02-15 23:14:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2023-02-15 23:14:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072922762] [2023-02-15 23:14:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 68968, now seen corresponding path program 1 times [2023-02-15 23:14:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174316394] [2023-02-15 23:14:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:32,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174316394] [2023-02-15 23:14:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174316394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:32,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 23:14:32,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921697677] [2023-02-15 23:14:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:32,251 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 23:14:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 23:14:32,281 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:32,291 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-02-15 23:14:32,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2023-02-15 23:14:32,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 23:14:32,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 28 transitions. [2023-02-15 23:14:32,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-02-15 23:14:32,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-15 23:14:32,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2023-02-15 23:14:32,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:32,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 23:14:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2023-02-15 23:14:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 23:14:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 23:14:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2023-02-15 23:14:32,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 23:14:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 23:14:32,341 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 23:14:32,341 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 23:14:32,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2023-02-15 23:14:32,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 23:14:32,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:32,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:32,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:32,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 23:14:32,344 INFO L748 eck$LassoCheckResult]: Stem: 75#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 68#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 65#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 66#L34-3 [2023-02-15 23:14:32,344 INFO L750 eck$LassoCheckResult]: Loop: 66#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 70#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 69#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 66#L34-3 [2023-02-15 23:14:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2023-02-15 23:14:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72069341] [2023-02-15 23:14:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 68720, now seen corresponding path program 1 times [2023-02-15 23:14:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839540403] [2023-02-15 23:14:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:32,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2051697257, now seen corresponding path program 1 times [2023-02-15 23:14:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:32,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525295138] [2023-02-15 23:14:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:32,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525295138] [2023-02-15 23:14:32,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525295138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:32,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:32,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:14:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180224156] [2023-02-15 23:14:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:32,474 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:32,475 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:32,475 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:32,475 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:32,475 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:32,475 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,475 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:32,475 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:32,475 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2023-02-15 23:14:32,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:32,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:32,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:32,499 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:32,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:32,528 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:32,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:32,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:32,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:32,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:32,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-15 23:14:32,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-02-15 23:14:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:32,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:32,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-15 23:14:32,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:32,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:32,689 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:32,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-15 23:14:32,695 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:32,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:32,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:32,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:32,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:32,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:32,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:32,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2023-02-15 23:14:32,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:32,696 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:32,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:32,712 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:32,768 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:32,771 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:32,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:32,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-15 23:14:32,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:32,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:32,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:32,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:32,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:32,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:32,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:32,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:32,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:32,847 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-02-15 23:14:32,847 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 23:14:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:32,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:32,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-15 23:14:32,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:32,899 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:32,900 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:32,900 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -1*ULTIMATE.start_main_~p~0#1 Supporting invariants [] [2023-02-15 23:14:32,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:32,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:32,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:32,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:32,943 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:32,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:32,987 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-15 23:14:32,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:33,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 39 transitions. Complement of second has 7 states. [2023-02-15 23:14:33,055 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 [2023-02-15 23:14:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2023-02-15 23:14:33,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-15 23:14:33,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:33,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-15 23:14:33,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:33,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-15 23:14:33,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:33,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2023-02-15 23:14:33,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 23:14:33,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 37 transitions. [2023-02-15 23:14:33,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-15 23:14:33,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 23:14:33,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2023-02-15 23:14:33,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:33,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-02-15 23:14:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2023-02-15 23:14:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-02-15 23:14:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 23:14:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-15 23:14:33,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 23:14:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 23:14:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 23:14:33,069 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:33,092 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-02-15 23:14:33,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2023-02-15 23:14:33,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-15 23:14:33,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2023-02-15 23:14:33,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 23:14:33,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 23:14:33,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2023-02-15 23:14:33,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:14:33,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-02-15 23:14:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2023-02-15 23:14:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-02-15 23:14:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 23:14:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-02-15 23:14:33,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-02-15 23:14:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:14:33,104 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-02-15 23:14:33,105 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 23:14:33,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2023-02-15 23:14:33,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-15 23:14:33,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:33,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:33,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 23:14:33,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:33,106 INFO L748 eck$LassoCheckResult]: Stem: 226#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 218#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 219#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 216#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 217#L34-3 [2023-02-15 23:14:33,107 INFO L750 eck$LassoCheckResult]: Loop: 217#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 222#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 208#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 215#$Ultimate##0 ~p := #in~p;~q := #in~q; 225#L20 assume ~p <= 0;#res := 1; 224#partsFINAL assume true; 207#partsEXIT >#68#return; 213#L36-1 havoc main_#t~ret8#1; 227#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 228#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 220#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 217#L34-3 [2023-02-15 23:14:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2023-02-15 23:14:33,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746320189] [2023-02-15 23:14:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 523036987, now seen corresponding path program 1 times [2023-02-15 23:14:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866738962] [2023-02-15 23:14:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1398357556, now seen corresponding path program 1 times [2023-02-15 23:14:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855182682] [2023-02-15 23:14:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:33,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:33,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:33,283 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:33,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:33,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:33,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:33,283 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:33,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:33,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:33,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2023-02-15 23:14:33,283 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:33,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:33,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,288 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,290 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:33,335 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-15 23:14:33,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:33,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:33,417 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:33,417 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:33,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,422 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-15 23:14:33,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:33,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:33,453 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:33,453 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=0} Honda state: {ULTIMATE.start_main_#t~ret8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:33,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-15 23:14:33,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:33,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:33,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:33,484 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:33,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-15 23:14:33,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:33,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:33,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-15 23:14:33,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:33,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:33,608 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:33,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,611 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:33,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:33,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:33,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:33,612 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:33,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:33,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:33,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2023-02-15 23:14:33,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:33,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:33,613 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,616 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:33,673 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:33,673 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:33,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,676 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 23:14:33,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:33,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:33,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:33,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:33,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:33,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:33,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:33,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:33,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:33,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-15 23:14:33,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:33,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:33,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:33,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:33,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:33,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:33,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:33,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:33,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:33,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,760 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-15 23:14:33,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:33,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:33,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:33,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:33,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:33,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:33,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:33,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:33,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:33,789 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:33,789 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:33,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:33,812 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:33,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-15 23:14:33,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:33,816 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:33,816 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:33,816 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2023-02-15 23:14:33,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:33,833 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:33,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:33,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:33,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:33,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:33,971 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 23:14:33,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:34,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 143 states and 212 transitions. Complement of second has 28 states. [2023-02-15 23:14:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2023-02-15 23:14:34,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 11 letters. [2023-02-15 23:14:34,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:34,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 15 letters. Loop has 11 letters. [2023-02-15 23:14:34,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:34,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 22 letters. [2023-02-15 23:14:34,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:34,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 212 transitions. [2023-02-15 23:14:34,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2023-02-15 23:14:34,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 211 transitions. [2023-02-15 23:14:34,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-02-15 23:14:34,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2023-02-15 23:14:34,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 211 transitions. [2023-02-15 23:14:34,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:34,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 211 transitions. [2023-02-15 23:14:34,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 211 transitions. [2023-02-15 23:14:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2023-02-15 23:14:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 88 states have internal predecessors, (122), 28 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (48), 36 states have call predecessors, (48), 28 states have call successors, (48) [2023-02-15 23:14:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2023-02-15 23:14:34,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-02-15 23:14:34,201 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-02-15 23:14:34,201 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 23:14:34,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 198 transitions. [2023-02-15 23:14:34,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2023-02-15 23:14:34,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:34,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:34,205 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:34,205 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:34,206 INFO L748 eck$LassoCheckResult]: Stem: 526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 499#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 496#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 497#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 535#L35-3 [2023-02-15 23:14:34,206 INFO L750 eck$LassoCheckResult]: Loop: 535#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 538#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 543#$Ultimate##0 ~p := #in~p;~q := #in~q; 563#L20 assume !(~p <= 0); 548#L21 assume ~q <= 0;#res := 0; 545#partsFINAL assume true; 542#partsEXIT >#68#return; 540#L36-1 havoc main_#t~ret8#1; 539#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 537#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 505#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 506#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 535#L35-3 [2023-02-15 23:14:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2023-02-15 23:14:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:34,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718781469] [2023-02-15 23:14:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1489423173, now seen corresponding path program 1 times [2023-02-15 23:14:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:34,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126289719] [2023-02-15 23:14:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 23:14:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:34,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:34,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126289719] [2023-02-15 23:14:34,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126289719] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:34,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:34,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 23:14:34,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432411100] [2023-02-15 23:14:34,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:34,423 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:34,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:34,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 23:14:34,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 23:14:34,424 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. cyclomatic complexity: 70 Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:34,619 INFO L93 Difference]: Finished difference Result 251 states and 420 transitions. [2023-02-15 23:14:34,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 420 transitions. [2023-02-15 23:14:34,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2023-02-15 23:14:34,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 245 states and 414 transitions. [2023-02-15 23:14:34,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-02-15 23:14:34,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-02-15 23:14:34,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 414 transitions. [2023-02-15 23:14:34,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:34,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 245 states and 414 transitions. [2023-02-15 23:14:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 414 transitions. [2023-02-15 23:14:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 214. [2023-02-15 23:14:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 40 states have call successors, (40), 12 states have call predecessors, (40), 30 states have return successors, (146), 57 states have call predecessors, (146), 40 states have call successors, (146) [2023-02-15 23:14:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 367 transitions. [2023-02-15 23:14:34,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 367 transitions. [2023-02-15 23:14:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 23:14:34,658 INFO L428 stractBuchiCegarLoop]: Abstraction has 214 states and 367 transitions. [2023-02-15 23:14:34,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 23:14:34,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 367 transitions. [2023-02-15 23:14:34,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2023-02-15 23:14:34,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:34,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:34,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:34,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:34,660 INFO L748 eck$LassoCheckResult]: Stem: 926#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 893#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 890#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 891#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 941#L35-3 [2023-02-15 23:14:34,660 INFO L750 eck$LassoCheckResult]: Loop: 941#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 933#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 948#$Ultimate##0 ~p := #in~p;~q := #in~q; 990#L20 assume !(~p <= 0); 986#L21 assume ~q <= 0;#res := 0; 987#partsFINAL assume true; 1011#partsEXIT >#68#return; 1010#L36-1 havoc main_#t~ret8#1; 1007#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 941#L35-3 [2023-02-15 23:14:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2023-02-15 23:14:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:34,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021279759] [2023-02-15 23:14:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:34,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 1 times [2023-02-15 23:14:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:34,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374836669] [2023-02-15 23:14:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:34,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 616296708, now seen corresponding path program 1 times [2023-02-15 23:14:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:34,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274586665] [2023-02-15 23:14:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:34,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274586665] [2023-02-15 23:14:34,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274586665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:34,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:34,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996305152] [2023-02-15 23:14:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:34,786 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:34,787 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:34,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:34,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:34,787 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:34,787 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,787 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:34,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:34,787 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2023-02-15 23:14:34,787 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:34,787 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:34,788 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,790 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,792 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,797 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,815 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:34,815 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:34,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:34,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:34,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-15 23:14:34,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:34,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:34,833 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:34,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=1} Honda state: {ULTIMATE.start_main_~p~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:34,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:34,838 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:34,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-15 23:14:34,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:34,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:34,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:34,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:34,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:34,851 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:34,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:34,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-15 23:14:34,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:34,882 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-15 23:14:34,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:34,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:34,909 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:34,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:34,919 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:34,919 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:34,919 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:34,919 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:34,919 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:34,919 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,919 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:34,919 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:34,919 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2023-02-15 23:14:34,919 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:34,919 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:34,920 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,922 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,930 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:34,950 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:34,950 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:34,959 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:34,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:34,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-15 23:14:35,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:35,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:35,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:35,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:35,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:35,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:35,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:35,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:35,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,028 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-15 23:14:35,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:35,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:35,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:35,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:35,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:35,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:35,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:35,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:35,082 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:35,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:35,097 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:35,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,108 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-15 23:14:35,112 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:35,112 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:35,113 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:35,113 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2023-02-15 23:14:35,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-02-15 23:14:35,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:35,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:14:35,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:35,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:35,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:35,220 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-15 23:14:35,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 367 transitions. cyclomatic complexity: 158 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:35,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 367 transitions. cyclomatic complexity: 158. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 887 states and 1628 transitions. Complement of second has 25 states. [2023-02-15 23:14:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2023-02-15 23:14:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 9 letters. [2023-02-15 23:14:35,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 14 letters. Loop has 9 letters. [2023-02-15 23:14:35,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 18 letters. [2023-02-15 23:14:35,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:35,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1628 transitions. [2023-02-15 23:14:35,321 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2023-02-15 23:14:35,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 830 states and 1524 transitions. [2023-02-15 23:14:35,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2023-02-15 23:14:35,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 247 [2023-02-15 23:14:35,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1524 transitions. [2023-02-15 23:14:35,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:35,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 830 states and 1524 transitions. [2023-02-15 23:14:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1524 transitions. [2023-02-15 23:14:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 758. [2023-02-15 23:14:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 490 states have (on average 1.2387755102040816) internal successors, (607), 491 states have internal predecessors, (607), 154 states have call successors, (154), 43 states have call predecessors, (154), 114 states have return successors, (650), 223 states have call predecessors, (650), 151 states have call successors, (650) [2023-02-15 23:14:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1411 transitions. [2023-02-15 23:14:35,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 1411 transitions. [2023-02-15 23:14:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 23:14:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 23:14:35,365 INFO L87 Difference]: Start difference. First operand 758 states and 1411 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:35,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-02-15 23:14:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:35,430 INFO L93 Difference]: Finished difference Result 649 states and 994 transitions. [2023-02-15 23:14:35,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 994 transitions. [2023-02-15 23:14:35,435 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2023-02-15 23:14:35,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 312 states and 455 transitions. [2023-02-15 23:14:35,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2023-02-15 23:14:35,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2023-02-15 23:14:35,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 455 transitions. [2023-02-15 23:14:35,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:35,438 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 455 transitions. [2023-02-15 23:14:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 455 transitions. [2023-02-15 23:14:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 298. [2023-02-15 23:14:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 197 states have (on average 1.2385786802030456) internal successors, (244), 200 states have internal predecessors, (244), 69 states have call successors, (69), 27 states have call predecessors, (69), 32 states have return successors, (128), 70 states have call predecessors, (128), 61 states have call successors, (128) [2023-02-15 23:14:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 441 transitions. [2023-02-15 23:14:35,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 298 states and 441 transitions. [2023-02-15 23:14:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:35,447 INFO L428 stractBuchiCegarLoop]: Abstraction has 298 states and 441 transitions. [2023-02-15 23:14:35,447 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 23:14:35,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 441 transitions. [2023-02-15 23:14:35,449 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2023-02-15 23:14:35,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:35,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:35,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:35,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:35,449 INFO L748 eck$LassoCheckResult]: Stem: 3541#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 3508#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3501#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 3502#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 3553#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3503#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3504#$Ultimate##0 ~p := #in~p;~q := #in~q; 3721#L20 assume ~p <= 0;#res := 1; 3719#partsFINAL assume true; 3720#partsEXIT >#68#return; 3548#L36-1 [2023-02-15 23:14:35,449 INFO L750 eck$LassoCheckResult]: Loop: 3548#L36-1 havoc main_#t~ret8#1; 3542#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3526#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3497#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3723#$Ultimate##0 ~p := #in~p;~q := #in~q; 3724#L20 assume ~p <= 0;#res := 1; 3752#partsFINAL assume true; 3718#partsEXIT >#68#return; 3548#L36-1 [2023-02-15 23:14:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash 618653416, now seen corresponding path program 1 times [2023-02-15 23:14:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:35,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794780945] [2023-02-15 23:14:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:35,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:35,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 1 times [2023-02-15 23:14:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:35,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983823526] [2023-02-15 23:14:35,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1870257459, now seen corresponding path program 1 times [2023-02-15 23:14:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:35,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435501471] [2023-02-15 23:14:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:35,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:35,522 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:35,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:35,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:35,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:35,523 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:35,523 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,523 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:35,523 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:35,523 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2023-02-15 23:14:35,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:35,523 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:35,523 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,525 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,529 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,530 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,551 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:35,551 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:35,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,552 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-15 23:14:35,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:35,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:35,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:35,576 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=1} Honda state: {ULTIMATE.start_main_#t~ret8#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:35,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,599 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 23:14:35,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:35,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:35,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:35,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,619 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 23:14:35,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:35,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:35,866 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:35,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:35,871 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:35,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:35,872 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:35,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:35,872 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:35,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:35,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:35,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2023-02-15 23:14:35,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:35,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:35,872 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,880 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:35,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:35,899 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,910 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 23:14:35,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:35,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:35,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:35,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:35,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:35,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:35,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:35,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:35,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:35,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:35,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:35,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:35,960 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 23:14:36,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:36,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:36,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:36,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:36,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:36,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:36,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:36,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:36,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:36,042 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:36,042 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:36,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,043 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 23:14:36,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:36,061 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:36,061 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:36,061 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-15 23:14:36,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,066 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:14:36,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:36,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:36,168 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:36,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 298 states and 441 transitions. cyclomatic complexity: 151 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:36,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 298 states and 441 transitions. cyclomatic complexity: 151. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 441 states and 656 transitions. Complement of second has 13 states. [2023-02-15 23:14:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2023-02-15 23:14:36,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 8 letters. [2023-02-15 23:14:36,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 19 letters. Loop has 8 letters. [2023-02-15 23:14:36,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 16 letters. [2023-02-15 23:14:36,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 656 transitions. [2023-02-15 23:14:36,232 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2023-02-15 23:14:36,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 356 states and 523 transitions. [2023-02-15 23:14:36,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-15 23:14:36,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2023-02-15 23:14:36,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 523 transitions. [2023-02-15 23:14:36,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:36,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 356 states and 523 transitions. [2023-02-15 23:14:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 523 transitions. [2023-02-15 23:14:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2023-02-15 23:14:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 234 states have (on average 1.2179487179487178) internal successors, (285), 234 states have internal predecessors, (285), 81 states have call successors, (83), 34 states have call predecessors, (83), 39 states have return successors, (152), 85 states have call predecessors, (152), 71 states have call successors, (152) [2023-02-15 23:14:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 520 transitions. [2023-02-15 23:14:36,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 520 transitions. [2023-02-15 23:14:36,242 INFO L428 stractBuchiCegarLoop]: Abstraction has 354 states and 520 transitions. [2023-02-15 23:14:36,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 23:14:36,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 520 transitions. [2023-02-15 23:14:36,244 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2023-02-15 23:14:36,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:36,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:36,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:36,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:36,245 INFO L748 eck$LassoCheckResult]: Stem: 4368#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4334#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4335#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4332#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4333#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4351#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 4336#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 4337#$Ultimate##0 ~p := #in~p;~q := #in~q; 4535#L20 assume !(~p <= 0); 4536#L21 assume !(~q <= 0); 4597#L22 assume ~q > ~p; 4577#L22-1 call #t~ret0 := parts(~p, ~p);< 4619#$Ultimate##0 [2023-02-15 23:14:36,245 INFO L750 eck$LassoCheckResult]: Loop: 4619#$Ultimate##0 ~p := #in~p;~q := #in~q; 4624#L20 assume !(~p <= 0); 4621#L21 assume !(~q <= 0); 4620#L22 assume ~q > ~p; 4572#L22-1 call #t~ret0 := parts(~p, ~p);< 4619#$Ultimate##0 [2023-02-15 23:14:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1998405187, now seen corresponding path program 1 times [2023-02-15 23:14:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:36,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109903570] [2023-02-15 23:14:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:36,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:36,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109903570] [2023-02-15 23:14:36,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109903570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:36,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:36,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:36,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859340409] [2023-02-15 23:14:36,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:36,266 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 28756405, now seen corresponding path program 1 times [2023-02-15 23:14:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275755571] [2023-02-15 23:14:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:36,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:36,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:36,309 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:36,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:36,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:36,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:36,309 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:36,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:36,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:36,309 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2023-02-15 23:14:36,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:36,309 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:36,310 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,311 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,318 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,319 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,321 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:36,347 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:36,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,348 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-15 23:14:36,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:36,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:36,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:36,381 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:36,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,401 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-15 23:14:36,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:36,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:36,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,433 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-15 23:14:36,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:36,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:36,465 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:36,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,468 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:36,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:36,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:36,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:36,469 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:36,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:36,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:36,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2023-02-15 23:14:36,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:36,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:36,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:36,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:36,520 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,521 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-15 23:14:36,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:36,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:36,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:36,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:36,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:36,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:36,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:36,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:36,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:36,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,580 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-15 23:14:36,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:36,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:36,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:36,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:36,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:36,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:36,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:36,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:36,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:36,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-02-15 23:14:36,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,603 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-15 23:14:36,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:36,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:36,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:36,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:36,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:36,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:36,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:36,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:36,615 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:36,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:36,617 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:36,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:36,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,618 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-15 23:14:36,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:36,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:36,621 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:36,621 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2023-02-15 23:14:36,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-15 23:14:36,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:36,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:36,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:36,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:36,752 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-15 23:14:36,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 520 transitions. cyclomatic complexity: 175 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:36,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 520 transitions. cyclomatic complexity: 175. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1097 states and 1995 transitions. Complement of second has 41 states. [2023-02-15 23:14:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2023-02-15 23:14:36,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2023-02-15 23:14:36,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2023-02-15 23:14:36,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2023-02-15 23:14:36,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:36,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1995 transitions. [2023-02-15 23:14:36,840 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 218 [2023-02-15 23:14:36,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 1016 states and 1851 transitions. [2023-02-15 23:14:36,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2023-02-15 23:14:36,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2023-02-15 23:14:36,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1016 states and 1851 transitions. [2023-02-15 23:14:36,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:36,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1016 states and 1851 transitions. [2023-02-15 23:14:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states and 1851 transitions. [2023-02-15 23:14:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 911. [2023-02-15 23:14:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 589 states have (on average 1.2393887945670627) internal successors, (730), 621 states have internal predecessors, (730), 228 states have call successors, (230), 98 states have call predecessors, (230), 94 states have return successors, (613), 191 states have call predecessors, (613), 203 states have call successors, (613) [2023-02-15 23:14:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1573 transitions. [2023-02-15 23:14:36,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 911 states and 1573 transitions. [2023-02-15 23:14:36,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 23:14:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 23:14:36,888 INFO L87 Difference]: Start difference. First operand 911 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:14:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:36,915 INFO L93 Difference]: Finished difference Result 546 states and 873 transitions. [2023-02-15 23:14:36,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 873 transitions. [2023-02-15 23:14:36,919 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2023-02-15 23:14:36,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 529 states and 855 transitions. [2023-02-15 23:14:36,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2023-02-15 23:14:36,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2023-02-15 23:14:36,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 855 transitions. [2023-02-15 23:14:36,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:36,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 855 transitions. [2023-02-15 23:14:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 855 transitions. [2023-02-15 23:14:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 524. [2023-02-15 23:14:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 353 states have (on average 1.2492917847025495) internal successors, (441), 370 states have internal predecessors, (441), 114 states have call successors, (115), 52 states have call predecessors, (115), 57 states have return successors, (294), 101 states have call predecessors, (294), 112 states have call successors, (294) [2023-02-15 23:14:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2023-02-15 23:14:36,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 524 states and 850 transitions. [2023-02-15 23:14:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:36,935 INFO L428 stractBuchiCegarLoop]: Abstraction has 524 states and 850 transitions. [2023-02-15 23:14:36,935 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 23:14:36,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 850 transitions. [2023-02-15 23:14:36,937 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2023-02-15 23:14:36,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:36,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:36,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:36,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:36,938 INFO L748 eck$LassoCheckResult]: Stem: 7418#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 7366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 7367#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7364#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 7365#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 7436#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7836#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7837#$Ultimate##0 ~p := #in~p;~q := #in~q; 7842#L20 assume ~p <= 0;#res := 1; 7841#partsFINAL assume true; 7835#partsEXIT >#68#return; 7833#L36-1 havoc main_#t~ret8#1; 7647#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7645#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 7600#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 7598#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 7450#L35-3 [2023-02-15 23:14:36,938 INFO L750 eck$LassoCheckResult]: Loop: 7450#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7440#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7548#$Ultimate##0 ~p := #in~p;~q := #in~q; 7554#L20 assume !(~p <= 0); 7555#L21 assume ~q <= 0;#res := 0; 7585#partsFINAL assume true; 7609#partsEXIT >#68#return; 7605#L36-1 havoc main_#t~ret8#1; 7597#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7450#L35-3 [2023-02-15 23:14:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 399411315, now seen corresponding path program 2 times [2023-02-15 23:14:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:36,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039112017] [2023-02-15 23:14:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039112017] [2023-02-15 23:14:36,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039112017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451827247] [2023-02-15 23:14:36,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:36,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:36,997 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:36,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-15 23:14:37,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:37,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:37,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:37,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451827247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:37,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:37,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-15 23:14:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439845158] [2023-02-15 23:14:37,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:37,094 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 2 times [2023-02-15 23:14:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:37,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708383682] [2023-02-15 23:14:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:37,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:37,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:37,163 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:37,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:37,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:37,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:37,163 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:37,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:37,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:37,164 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2023-02-15 23:14:37,164 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:37,164 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:37,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,169 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,186 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:37,186 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:37,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,188 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-15 23:14:37,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:37,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:37,213 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=1} Honda state: {ULTIMATE.start_main_~p~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:37,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,217 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-15 23:14:37,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:37,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,242 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:37,242 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:37,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-15 23:14:37,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,247 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-15 23:14:37,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:37,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:37,271 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=0} Honda state: {ULTIMATE.start_main_#t~ret8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:37,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-15 23:14:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,275 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-15 23:14:37,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:37,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-15 23:14:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,303 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-15 23:14:37,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:37,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:37,327 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:37,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-02-15 23:14:37,330 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:37,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:37,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:37,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:37,331 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:37,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:37,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:37,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2023-02-15 23:14:37,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:37,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:37,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,334 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,339 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:37,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:37,366 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,368 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-15 23:14:37,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,396 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-15 23:14:37,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,424 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-15 23:14:37,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:37,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,452 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:37,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:37,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:37,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:37,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:37,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:37,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:37,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:37,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-15 23:14:37,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:37,466 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:37,466 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:14:37,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:37,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:37,467 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:37,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-15 23:14:37,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:37,470 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:37,470 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:37,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2023-02-15 23:14:37,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,473 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:37,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:37,615 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:37,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,630 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 549 states and 878 transitions. Complement of second has 9 states. [2023-02-15 23:14:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:14:37,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 23:14:37,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:37,631 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:37,721 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:37,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 549 states and 878 transitions. Complement of second has 9 states. [2023-02-15 23:14:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:14:37,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 23:14:37,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:37,737 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:37,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:37,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:37,840 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:37,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 1496 states and 2733 transitions. Complement of second has 24 states. [2023-02-15 23:14:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2023-02-15 23:14:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 23:14:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 25 letters. Loop has 9 letters. [2023-02-15 23:14:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 18 letters. [2023-02-15 23:14:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:37,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 2733 transitions. [2023-02-15 23:14:37,972 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 118 [2023-02-15 23:14:37,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1379 states and 2526 transitions. [2023-02-15 23:14:37,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2023-02-15 23:14:37,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 292 [2023-02-15 23:14:37,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1379 states and 2526 transitions. [2023-02-15 23:14:37,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:37,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1379 states and 2526 transitions. [2023-02-15 23:14:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states and 2526 transitions. [2023-02-15 23:14:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1298. [2023-02-15 23:14:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 831 states have (on average 1.2214199759326112) internal successors, (1015), 868 states have internal predecessors, (1015), 322 states have call successors, (323), 122 states have call predecessors, (323), 145 states have return successors, (1031), 307 states have call predecessors, (1031), 314 states have call successors, (1031) [2023-02-15 23:14:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2369 transitions. [2023-02-15 23:14:38,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1298 states and 2369 transitions. [2023-02-15 23:14:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 23:14:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 23:14:38,063 INFO L87 Difference]: Start difference. First operand 1298 states and 2369 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:38,140 INFO L93 Difference]: Finished difference Result 1477 states and 2646 transitions. [2023-02-15 23:14:38,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1477 states and 2646 transitions. [2023-02-15 23:14:38,152 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 158 [2023-02-15 23:14:38,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1477 states to 1463 states and 2631 transitions. [2023-02-15 23:14:38,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2023-02-15 23:14:38,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2023-02-15 23:14:38,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1463 states and 2631 transitions. [2023-02-15 23:14:38,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:38,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1463 states and 2631 transitions. [2023-02-15 23:14:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states and 2631 transitions. [2023-02-15 23:14:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1303. [2023-02-15 23:14:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 832 states have (on average 1.2223557692307692) internal successors, (1017), 874 states have internal predecessors, (1017), 326 states have call successors, (327), 122 states have call predecessors, (327), 145 states have return successors, (1047), 306 states have call predecessors, (1047), 318 states have call successors, (1047) [2023-02-15 23:14:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2391 transitions. [2023-02-15 23:14:38,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2023-02-15 23:14:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 23:14:38,248 INFO L428 stractBuchiCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2023-02-15 23:14:38,248 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 23:14:38,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 2391 transitions. [2023-02-15 23:14:38,253 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 112 [2023-02-15 23:14:38,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:38,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:38,254 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:38,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-02-15 23:14:38,255 INFO L748 eck$LassoCheckResult]: Stem: 13719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 13673#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13666#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 13667#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13736#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14622#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14624#$Ultimate##0 ~p := #in~p;~q := #in~q; 14627#L20 assume ~p <= 0;#res := 1; 14625#partsFINAL assume true; 14621#partsEXIT >#68#return; 14618#L36-1 havoc main_#t~ret8#1; 14615#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14613#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14536#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14538#$Ultimate##0 ~p := #in~p;~q := #in~q; 14540#L20 assume ~p <= 0;#res := 1; 14539#partsFINAL assume true; 14535#partsEXIT >#68#return; 14512#L36-1 havoc main_#t~ret8#1; 14511#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13999#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13998#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13997#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13995#L35-3 [2023-02-15 23:14:38,255 INFO L750 eck$LassoCheckResult]: Loop: 13995#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13652#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 13994#$Ultimate##0 ~p := #in~p;~q := #in~q; 13992#L20 assume !(~p <= 0); 13991#L21 assume !(~q <= 0); 13989#L22 assume !(~q > ~p); 13698#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13797#$Ultimate##0 ~p := #in~p;~q := #in~q; 14013#L20 assume !(~p <= 0); 13692#L21 assume !(~q <= 0); 13703#L22 assume !(~q > ~p); 13696#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13797#$Ultimate##0 ~p := #in~p;~q := #in~q; 14013#L20 assume ~p <= 0;#res := 1; 13978#partsFINAL assume true; 13979#partsEXIT >#64#return; 13693#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13824#$Ultimate##0 ~p := #in~p;~q := #in~q; 13735#L20 assume !(~p <= 0); 13692#L21 assume ~q <= 0;#res := 0; 13702#partsFINAL assume true; 14003#partsEXIT >#66#return; 14004#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 14277#partsFINAL assume true; 14259#partsEXIT >#64#return; 13816#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13969#$Ultimate##0 ~p := #in~p;~q := #in~q; 14257#L20 assume !(~p <= 0); 14255#L21 assume ~q <= 0;#res := 0; 13702#partsFINAL assume true; 14003#partsEXIT >#66#return; 13713#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13714#partsFINAL assume true; 13730#partsEXIT >#68#return; 13732#L36-1 havoc main_#t~ret8#1; 13733#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13683#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13651#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 13994#$Ultimate##0 ~p := #in~p;~q := #in~q; 13992#L20 assume !(~p <= 0); 13991#L21 assume !(~q <= 0); 13989#L22 assume !(~q > ~p); 13698#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13797#$Ultimate##0 ~p := #in~p;~q := #in~q; 14013#L20 assume ~p <= 0;#res := 1; 13978#partsFINAL assume true; 13979#partsEXIT >#64#return; 13694#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13824#$Ultimate##0 ~p := #in~p;~q := #in~q; 13735#L20 assume !(~p <= 0); 13692#L21 assume ~q <= 0;#res := 0; 13702#partsFINAL assume true; 14003#partsEXIT >#66#return; 14002#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13748#partsFINAL assume true; 13749#partsEXIT >#68#return; 14001#L36-1 havoc main_#t~ret8#1; 14000#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13739#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13740#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13996#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13995#L35-3 [2023-02-15 23:14:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 3 times [2023-02-15 23:14:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954580346] [2023-02-15 23:14:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:38,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash 144582960, now seen corresponding path program 1 times [2023-02-15 23:14:38,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:38,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770851679] [2023-02-15 23:14:38,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 23:14:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:14:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:14:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-15 23:14:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:38,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770851679] [2023-02-15 23:14:38,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770851679] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:38,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092310147] [2023-02-15 23:14:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:38,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:38,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:38,484 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:38,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-02-15 23:14:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:38,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:38,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-02-15 23:14:38,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 29 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-15 23:14:38,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092310147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:38,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:38,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 23 [2023-02-15 23:14:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507942583] [2023-02-15 23:14:38,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:38,812 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 23:14:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-02-15 23:14:38,813 INFO L87 Difference]: Start difference. First operand 1303 states and 2391 transitions. cyclomatic complexity: 1113 Second operand has 23 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 11 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-15 23:14:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:39,504 INFO L93 Difference]: Finished difference Result 2270 states and 4654 transitions. [2023-02-15 23:14:39,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2270 states and 4654 transitions. [2023-02-15 23:14:39,523 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 165 [2023-02-15 23:14:39,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2270 states to 1211 states and 2330 transitions. [2023-02-15 23:14:39,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2023-02-15 23:14:39,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2023-02-15 23:14:39,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1211 states and 2330 transitions. [2023-02-15 23:14:39,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:39,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1211 states and 2330 transitions. [2023-02-15 23:14:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states and 2330 transitions. [2023-02-15 23:14:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1117. [2023-02-15 23:14:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 758 states have (on average 1.1794195250659631) internal successors, (894), 798 states have internal predecessors, (894), 220 states have call successors, (221), 105 states have call predecessors, (221), 139 states have return successors, (936), 213 states have call predecessors, (936), 220 states have call successors, (936) [2023-02-15 23:14:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 2051 transitions. [2023-02-15 23:14:39,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1117 states and 2051 transitions. [2023-02-15 23:14:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 23:14:39,588 INFO L428 stractBuchiCegarLoop]: Abstraction has 1117 states and 2051 transitions. [2023-02-15 23:14:39,588 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 23:14:39,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 2051 transitions. [2023-02-15 23:14:39,593 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 157 [2023-02-15 23:14:39,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:39,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:39,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:39,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:39,594 INFO L748 eck$LassoCheckResult]: Stem: 17828#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 17763#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 17764#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17757#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 17758#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18369#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 18364#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18366#$Ultimate##0 ~p := #in~p;~q := #in~q; 18370#L20 assume ~p <= 0;#res := 1; 18367#partsFINAL assume true; 18363#partsEXIT >#68#return; 18362#L36-1 havoc main_#t~ret8#1; 18361#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18359#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 18355#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18357#$Ultimate##0 ~p := #in~p;~q := #in~q; 18360#L20 assume ~p <= 0;#res := 1; 18358#partsFINAL assume true; 18354#partsEXIT >#68#return; 18353#L36-1 havoc main_#t~ret8#1; 18351#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18349#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 17776#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 17777#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18388#L35-3 [2023-02-15 23:14:39,594 INFO L750 eck$LassoCheckResult]: Loop: 18388#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 17749#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18618#$Ultimate##0 ~p := #in~p;~q := #in~q; 18623#L20 assume !(~p <= 0); 18621#L21 assume ~q <= 0;#res := 0; 18619#partsFINAL assume true; 18617#partsEXIT >#68#return; 18616#L36-1 havoc main_#t~ret8#1; 18613#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18595#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 17802#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 17801#$Ultimate##0 ~p := #in~p;~q := #in~q; 17804#L20 assume !(~p <= 0); 17844#L21 assume !(~q <= 0); 18432#L22 assume !(~q > ~p); 18433#L23 call #t~ret1 := parts(~p - ~q, ~q);< 18551#$Ultimate##0 ~p := #in~p;~q := #in~q; 18555#L20 assume ~p <= 0;#res := 1; 18554#partsFINAL assume true; 18550#partsEXIT >#64#return; 18446#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 18577#$Ultimate##0 ~p := #in~p;~q := #in~q; 18575#L20 assume !(~p <= 0); 18576#L21 assume ~q <= 0;#res := 0; 18695#partsFINAL assume true; 18693#partsEXIT >#66#return; 18692#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 18691#partsFINAL assume true; 18624#partsEXIT >#68#return; 18625#L36-1 havoc main_#t~ret8#1; 18599#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18596#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 18597#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18626#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18388#L35-3 [2023-02-15 23:14:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 4 times [2023-02-15 23:14:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:39,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261363526] [2023-02-15 23:14:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:39,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:39,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1754826426, now seen corresponding path program 2 times [2023-02-15 23:14:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:39,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913787811] [2023-02-15 23:14:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 23:14:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 23:14:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 23:14:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:39,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913787811] [2023-02-15 23:14:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913787811] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:39,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977182932] [2023-02-15 23:14:39,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:39,705 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:39,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-02-15 23:14:39,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:39,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:39,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 23:14:39,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 23:14:39,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 23:14:39,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977182932] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:39,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:39,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-02-15 23:14:39,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606244641] [2023-02-15 23:14:39,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:39,979 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 23:14:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-15 23:14:39,980 INFO L87 Difference]: Start difference. First operand 1117 states and 2051 transitions. cyclomatic complexity: 967 Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 23:14:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:40,279 INFO L93 Difference]: Finished difference Result 1391 states and 2538 transitions. [2023-02-15 23:14:40,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1391 states and 2538 transitions. [2023-02-15 23:14:40,289 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 241 [2023-02-15 23:14:40,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1391 states to 1371 states and 2512 transitions. [2023-02-15 23:14:40,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 614 [2023-02-15 23:14:40,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2023-02-15 23:14:40,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1371 states and 2512 transitions. [2023-02-15 23:14:40,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:40,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1371 states and 2512 transitions. [2023-02-15 23:14:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states and 2512 transitions. [2023-02-15 23:14:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1133. [2023-02-15 23:14:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 774 states have (on average 1.17312661498708) internal successors, (908), 808 states have internal predecessors, (908), 220 states have call successors, (221), 105 states have call predecessors, (221), 139 states have return successors, (932), 219 states have call predecessors, (932), 220 states have call successors, (932) [2023-02-15 23:14:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 2061 transitions. [2023-02-15 23:14:40,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1133 states and 2061 transitions. [2023-02-15 23:14:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 23:14:40,332 INFO L428 stractBuchiCegarLoop]: Abstraction has 1133 states and 2061 transitions. [2023-02-15 23:14:40,332 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 23:14:40,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1133 states and 2061 transitions. [2023-02-15 23:14:40,341 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 161 [2023-02-15 23:14:40,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:40,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:40,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:40,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-02-15 23:14:40,344 INFO L748 eck$LassoCheckResult]: Stem: 20607#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 20551#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20544#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 20545#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21153#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21149#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21150#$Ultimate##0 ~p := #in~p;~q := #in~q; 21155#L20 assume ~p <= 0;#res := 1; 21152#partsFINAL assume true; 21148#partsEXIT >#68#return; 21146#L36-1 havoc main_#t~ret8#1; 21145#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21143#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21139#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21141#$Ultimate##0 ~p := #in~p;~q := #in~q; 21144#L20 assume ~p <= 0;#res := 1; 21142#partsFINAL assume true; 21138#partsEXIT >#68#return; 21137#L36-1 havoc main_#t~ret8#1; 21136#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20635#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 20636#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 21112#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21522#L35-3 [2023-02-15 23:14:40,344 INFO L750 eck$LassoCheckResult]: Loop: 21522#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21304#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21433#$Ultimate##0 ~p := #in~p;~q := #in~q; 21434#L20 assume !(~p <= 0); 21395#L21 assume !(~q <= 0); 21396#L22 assume !(~q > ~p); 21241#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21317#$Ultimate##0 ~p := #in~p;~q := #in~q; 21320#L20 assume ~p <= 0;#res := 1; 21318#partsFINAL assume true; 21316#partsEXIT >#64#return; 21240#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21334#$Ultimate##0 ~p := #in~p;~q := #in~q; 21272#L20 assume !(~p <= 0); 21273#L21 assume !(~q <= 0); 21262#L22 assume !(~q > ~p); 21242#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21317#$Ultimate##0 ~p := #in~p;~q := #in~q; 21320#L20 assume ~p <= 0;#res := 1; 21318#partsFINAL assume true; 21316#partsEXIT >#64#return; 21238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21334#$Ultimate##0 ~p := #in~p;~q := #in~q; 21272#L20 assume !(~p <= 0); 21273#L21 assume ~q <= 0;#res := 0; 21490#partsFINAL assume true; 21487#partsEXIT >#66#return; 21482#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21479#partsFINAL assume true; 21476#partsEXIT >#66#return; 21417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21539#partsFINAL assume true; 21537#partsEXIT >#68#return; 21538#L36-1 havoc main_#t~ret8#1; 21540#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21536#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21303#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21520#$Ultimate##0 ~p := #in~p;~q := #in~q; 21429#L20 assume !(~p <= 0); 21395#L21 assume !(~q <= 0); 21396#L22 assume !(~q > ~p); 21241#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21317#$Ultimate##0 ~p := #in~p;~q := #in~q; 21320#L20 assume ~p <= 0;#res := 1; 21318#partsFINAL assume true; 21316#partsEXIT >#64#return; 21240#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21334#$Ultimate##0 ~p := #in~p;~q := #in~q; 21272#L20 assume !(~p <= 0); 21273#L21 assume !(~q <= 0); 21262#L22 assume !(~q > ~p); 21242#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21317#$Ultimate##0 ~p := #in~p;~q := #in~q; 21320#L20 assume ~p <= 0;#res := 1; 21318#partsFINAL assume true; 21316#partsEXIT >#64#return; 21238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21334#$Ultimate##0 ~p := #in~p;~q := #in~q; 21272#L20 assume !(~p <= 0); 21273#L21 assume ~q <= 0;#res := 0; 21490#partsFINAL assume true; 21487#partsEXIT >#66#return; 21482#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21479#partsFINAL assume true; 21476#partsEXIT >#66#return; 21417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21539#partsFINAL assume true; 21537#partsEXIT >#68#return; 21535#L36-1 havoc main_#t~ret8#1; 21532#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21530#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 21529#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 21524#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21522#L35-3 [2023-02-15 23:14:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 5 times [2023-02-15 23:14:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:40,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354042674] [2023-02-15 23:14:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:40,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:40,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1918357508, now seen corresponding path program 3 times [2023-02-15 23:14:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75541158] [2023-02-15 23:14:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 23:14:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 23:14:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 75 proven. 55 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-02-15 23:14:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75541158] [2023-02-15 23:14:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75541158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909857800] [2023-02-15 23:14:40,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:14:40,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:40,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:40,628 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:40,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-02-15 23:14:40,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 23:14:40,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:40,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:40,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-02-15 23:14:40,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-02-15 23:14:40,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909857800] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:40,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:40,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2023-02-15 23:14:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134592666] [2023-02-15 23:14:40,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:40,885 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:14:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:40,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 23:14:40,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 23:14:40,885 INFO L87 Difference]: Start difference. First operand 1133 states and 2061 transitions. cyclomatic complexity: 961 Second operand has 16 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 23:14:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:41,190 INFO L93 Difference]: Finished difference Result 1232 states and 2045 transitions. [2023-02-15 23:14:41,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1232 states and 2045 transitions. [2023-02-15 23:14:41,198 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 166 [2023-02-15 23:14:41,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1232 states to 1178 states and 1929 transitions. [2023-02-15 23:14:41,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2023-02-15 23:14:41,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2023-02-15 23:14:41,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1178 states and 1929 transitions. [2023-02-15 23:14:41,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:41,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1178 states and 1929 transitions. [2023-02-15 23:14:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states and 1929 transitions. [2023-02-15 23:14:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1050. [2023-02-15 23:14:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 730 states have (on average 1.1479452054794521) internal successors, (838), 764 states have internal predecessors, (838), 188 states have call successors, (189), 106 states have call predecessors, (189), 132 states have return successors, (640), 179 states have call predecessors, (640), 186 states have call successors, (640) [2023-02-15 23:14:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1667 transitions. [2023-02-15 23:14:41,239 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1050 states and 1667 transitions. [2023-02-15 23:14:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 23:14:41,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 1050 states and 1667 transitions. [2023-02-15 23:14:41,240 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 23:14:41,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1050 states and 1667 transitions. [2023-02-15 23:14:41,244 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 133 [2023-02-15 23:14:41,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:41,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:41,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:41,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:41,245 INFO L748 eck$LassoCheckResult]: Stem: 23565#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 23524#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23525#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 23518#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 23519#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 24043#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 24039#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24041#$Ultimate##0 ~p := #in~p;~q := #in~q; 24047#L20 assume ~p <= 0;#res := 1; 24046#partsFINAL assume true; 24038#partsEXIT >#68#return; 24036#L36-1 havoc main_#t~ret8#1; 24035#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24034#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 24030#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24032#$Ultimate##0 ~p := #in~p;~q := #in~q; 24042#L20 assume ~p <= 0;#res := 1; 24037#partsFINAL assume true; 24029#partsEXIT >#68#return; 24028#L36-1 havoc main_#t~ret8#1; 24027#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 23919#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 23914#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23910#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 23911#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 23494#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24258#$Ultimate##0 ~p := #in~p;~q := #in~q; 24426#L20 assume ~p <= 0;#res := 1; 24424#partsFINAL assume true; 24416#partsEXIT >#68#return; 24408#L36-1 [2023-02-15 23:14:41,245 INFO L750 eck$LassoCheckResult]: Loop: 24408#L36-1 havoc main_#t~ret8#1; 24403#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24399#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 23568#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24334#$Ultimate##0 ~p := #in~p;~q := #in~q; 24335#L20 assume ~p <= 0;#res := 1; 24417#partsFINAL assume true; 24415#partsEXIT >#68#return; 24408#L36-1 [2023-02-15 23:14:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 768924849, now seen corresponding path program 6 times [2023-02-15 23:14:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:41,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334197819] [2023-02-15 23:14:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 23:14:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 23:14:41,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334197819] [2023-02-15 23:14:41,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334197819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:41,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:41,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014984764] [2023-02-15 23:14:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:41,276 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:41,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 2 times [2023-02-15 23:14:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:41,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756072390] [2023-02-15 23:14:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:41,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:41,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:41,327 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:41,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:41,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:41,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:41,327 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:41,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:41,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:41,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2023-02-15 23:14:41,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:41,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:41,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,330 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,352 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:41,352 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,355 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-15 23:14:41,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:41,381 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=0} Honda state: {ULTIMATE.start_main_~p~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:41,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,389 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-02-15 23:14:41,437 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:41,438 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:41,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,454 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-02-15 23:14:41,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:41,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,489 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-02-15 23:14:41,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:41,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:41,709 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:41,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:41,713 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:41,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:41,713 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:41,713 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:41,713 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:41,713 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,713 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:41,713 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:41,713 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2023-02-15 23:14:41,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:41,713 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:41,713 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,718 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,719 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,723 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:41,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:41,743 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,745 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-02-15 23:14:41,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:41,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-02-15 23:14:41,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,760 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-02-15 23:14:41,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:41,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-02-15 23:14:41,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,789 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-02-15 23:14:41,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:41,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:41,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:41,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:41,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:41,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:41,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:41,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:41,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:41,803 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:14:41,803 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:41,805 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:41,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-02-15 23:14:41,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:41,807 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:41,807 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:41,807 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2023-02-15 23:14:41,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-02-15 23:14:41,810 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:41,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:41,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:41,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:41,960 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:41,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1069 states and 1688 transitions. Complement of second has 10 states. [2023-02-15 23:14:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2023-02-15 23:14:41,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 23:14:41,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:41,994 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:42,112 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:42,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:42,150 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1067 states and 1685 transitions. Complement of second has 12 states. [2023-02-15 23:14:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2023-02-15 23:14:42,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 23:14:42,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,151 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:42,282 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:42,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:42,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1050 states and 1667 transitions. cyclomatic complexity: 644. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2476 states and 3951 transitions. Complement of second has 14 states. [2023-02-15 23:14:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2023-02-15 23:14:42,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 23:14:42,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 38 letters. Loop has 8 letters. [2023-02-15 23:14:42,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 16 letters. [2023-02-15 23:14:42,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:42,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2476 states and 3951 transitions. [2023-02-15 23:14:42,362 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 177 [2023-02-15 23:14:42,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2476 states to 1932 states and 2999 transitions. [2023-02-15 23:14:42,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 502 [2023-02-15 23:14:42,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 525 [2023-02-15 23:14:42,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1932 states and 2999 transitions. [2023-02-15 23:14:42,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:42,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1932 states and 2999 transitions. [2023-02-15 23:14:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states and 2999 transitions. [2023-02-15 23:14:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1802. [2023-02-15 23:14:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1242 states have (on average 1.1368760064412238) internal successors, (1412), 1303 states have internal predecessors, (1412), 345 states have call successors, (371), 210 states have call predecessors, (371), 215 states have return successors, (1041), 288 states have call predecessors, (1041), 324 states have call successors, (1041) [2023-02-15 23:14:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2824 transitions. [2023-02-15 23:14:42,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1802 states and 2824 transitions. [2023-02-15 23:14:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:14:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:14:42,409 INFO L87 Difference]: Start difference. First operand 1802 states and 2824 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 23:14:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:42,449 INFO L93 Difference]: Finished difference Result 1096 states and 1653 transitions. [2023-02-15 23:14:42,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1096 states and 1653 transitions. [2023-02-15 23:14:42,455 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 167 [2023-02-15 23:14:42,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1096 states to 704 states and 1133 transitions. [2023-02-15 23:14:42,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2023-02-15 23:14:42,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2023-02-15 23:14:42,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 704 states and 1133 transitions. [2023-02-15 23:14:42,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:42,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 704 states and 1133 transitions. [2023-02-15 23:14:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states and 1133 transitions. [2023-02-15 23:14:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 700. [2023-02-15 23:14:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 486 states have (on average 1.123456790123457) internal successors, (546), 495 states have internal predecessors, (546), 136 states have call successors, (146), 85 states have call predecessors, (146), 78 states have return successors, (437), 119 states have call predecessors, (437), 127 states have call successors, (437) [2023-02-15 23:14:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1129 transitions. [2023-02-15 23:14:42,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 700 states and 1129 transitions. [2023-02-15 23:14:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:42,474 INFO L428 stractBuchiCegarLoop]: Abstraction has 700 states and 1129 transitions. [2023-02-15 23:14:42,475 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 23:14:42,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 1129 transitions. [2023-02-15 23:14:42,477 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 167 [2023-02-15 23:14:42,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:42,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:42,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:42,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:42,478 INFO L748 eck$LassoCheckResult]: Stem: 32567#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 32521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 32522#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 32515#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 32516#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 32664#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32659#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32661#$Ultimate##0 ~p := #in~p;~q := #in~q; 32665#L20 assume ~p <= 0;#res := 1; 32662#partsFINAL assume true; 32658#partsEXIT >#68#return; 32657#L36-1 havoc main_#t~ret8#1; 32656#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32655#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32650#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32653#$Ultimate##0 ~p := #in~p;~q := #in~q; 32649#L20 assume ~p <= 0;#res := 1; 32651#partsFINAL assume true; 32780#partsEXIT >#68#return; 32778#L36-1 havoc main_#t~ret8#1; 32774#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32773#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 32753#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32745#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 32743#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32704#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32739#$Ultimate##0 ~p := #in~p;~q := #in~q; 32723#L20 assume !(~p <= 0); 32724#L21 assume !(~q <= 0); 32703#L22 assume !(~q > ~p); 32636#L23 call #t~ret1 := parts(~p - ~q, ~q);< 32815#$Ultimate##0 [2023-02-15 23:14:42,478 INFO L750 eck$LassoCheckResult]: Loop: 32815#$Ultimate##0 ~p := #in~p;~q := #in~q; 32832#L20 assume !(~p <= 0); 32709#L21 assume !(~q <= 0); 32710#L22 assume !(~q > ~p); 32635#L23 call #t~ret1 := parts(~p - ~q, ~q);< 32815#$Ultimate##0 [2023-02-15 23:14:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1933114887, now seen corresponding path program 1 times [2023-02-15 23:14:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:42,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875103544] [2023-02-15 23:14:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 23:14:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:42,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875103544] [2023-02-15 23:14:42,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875103544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:14:42,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:14:42,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 23:14:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080215898] [2023-02-15 23:14:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:14:42,499 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash 28756500, now seen corresponding path program 1 times [2023-02-15 23:14:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:42,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948306434] [2023-02-15 23:14:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:42,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:42,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:42,533 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:42,534 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:42,534 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:42,534 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:42,534 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:42,534 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,534 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:42,534 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:42,534 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2023-02-15 23:14:42,534 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:42,534 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:42,535 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,536 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,541 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,543 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,544 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,547 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:42,575 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:42,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,576 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-15 23:14:42,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:42,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:42,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:42,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:42,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,641 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-15 23:14:42,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:42,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:42,664 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:42,664 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:42,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,686 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-15 23:14:42,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:42,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:42,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,720 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:42,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-15 23:14:42,793 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:42,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-02-15 23:14:42,796 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:42,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:42,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:42,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:42,796 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:42,796 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,796 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:42,796 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:42,796 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2023-02-15 23:14:42,796 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:42,796 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:42,797 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,813 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,819 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,822 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:42,849 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:42,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:42,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,850 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-02-15 23:14:42,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:42,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:42,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:42,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:42,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:42,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:42,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:42,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:42,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:42,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,873 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-02-15 23:14:42,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:42,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:42,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:42,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:42,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:42,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:42,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:42,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:42,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:42,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,908 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-02-15 23:14:42,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:42,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:42,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:42,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:42,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:42,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:42,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:42,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:42,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:42,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:42,928 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:42,930 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:42,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-02-15 23:14:42,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:42,934 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:42,934 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:42,934 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2023-02-15 23:14:42,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2023-02-15 23:14:42,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:42,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:14:42,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:43,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:43,039 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:43,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 700 states and 1129 transitions. cyclomatic complexity: 449 Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:43,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 700 states and 1129 transitions. cyclomatic complexity: 449. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 967 states and 1498 transitions. Complement of second has 20 states. [2023-02-15 23:14:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2023-02-15 23:14:43,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 31 letters. Loop has 5 letters. [2023-02-15 23:14:43,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:43,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 36 letters. Loop has 5 letters. [2023-02-15 23:14:43,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:43,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 31 letters. Loop has 10 letters. [2023-02-15 23:14:43,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:43,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 967 states and 1498 transitions. [2023-02-15 23:14:43,110 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 167 [2023-02-15 23:14:43,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 967 states to 868 states and 1385 transitions. [2023-02-15 23:14:43,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2023-02-15 23:14:43,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2023-02-15 23:14:43,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 868 states and 1385 transitions. [2023-02-15 23:14:43,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:43,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 868 states and 1385 transitions. [2023-02-15 23:14:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states and 1385 transitions. [2023-02-15 23:14:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 804. [2023-02-15 23:14:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 562 states have (on average 1.1352313167259787) internal successors, (638), 580 states have internal predecessors, (638), 152 states have call successors, (162), 104 states have call predecessors, (162), 90 states have return successors, (487), 119 states have call predecessors, (487), 142 states have call successors, (487) [2023-02-15 23:14:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1287 transitions. [2023-02-15 23:14:43,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 804 states and 1287 transitions. [2023-02-15 23:14:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 23:14:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 23:14:43,135 INFO L87 Difference]: Start difference. First operand 804 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 23:14:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:43,158 INFO L93 Difference]: Finished difference Result 608 states and 943 transitions. [2023-02-15 23:14:43,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 943 transitions. [2023-02-15 23:14:43,161 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 107 [2023-02-15 23:14:43,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 596 states and 931 transitions. [2023-02-15 23:14:43,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-15 23:14:43,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2023-02-15 23:14:43,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 596 states and 931 transitions. [2023-02-15 23:14:43,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:43,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 596 states and 931 transitions. [2023-02-15 23:14:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states and 931 transitions. [2023-02-15 23:14:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 570. [2023-02-15 23:14:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 402 states have (on average 1.126865671641791) internal successors, (453), 418 states have internal predecessors, (453), 107 states have call successors, (117), 73 states have call predecessors, (117), 61 states have return successors, (335), 78 states have call predecessors, (335), 99 states have call successors, (335) [2023-02-15 23:14:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 905 transitions. [2023-02-15 23:14:43,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 570 states and 905 transitions. [2023-02-15 23:14:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:14:43,175 INFO L428 stractBuchiCegarLoop]: Abstraction has 570 states and 905 transitions. [2023-02-15 23:14:43,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-15 23:14:43,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 570 states and 905 transitions. [2023-02-15 23:14:43,177 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 101 [2023-02-15 23:14:43,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:43,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:43,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:43,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:43,178 INFO L748 eck$LassoCheckResult]: Stem: 35815#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 35739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 35740#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 35737#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 35738#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 35884#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35878#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35880#$Ultimate##0 ~p := #in~p;~q := #in~q; 35886#L20 assume ~p <= 0;#res := 1; 35882#partsFINAL assume true; 35877#partsEXIT >#68#return; 35866#L36-1 havoc main_#t~ret8#1; 35854#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35853#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35846#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35851#$Ultimate##0 ~p := #in~p;~q := #in~q; 35848#L20 assume ~p <= 0;#res := 1; 35845#partsFINAL assume true; 35847#partsEXIT >#68#return; 36282#L36-1 havoc main_#t~ret8#1; 35816#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35817#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 35751#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35752#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 35753#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35754#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35771#$Ultimate##0 ~p := #in~p;~q := #in~q; 35772#L20 assume !(~p <= 0); 35765#L21 assume ~q <= 0;#res := 0; 35766#partsFINAL assume true; 35830#partsEXIT >#68#return; 35896#L36-1 havoc main_#t~ret8#1; 35892#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35891#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35774#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35889#$Ultimate##0 ~p := #in~p;~q := #in~q; 35888#L20 assume !(~p <= 0); 35885#L21 assume !(~q <= 0); 35881#L22 assume !(~q > ~p); 35780#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35929#$Ultimate##0 ~p := #in~p;~q := #in~q; 35930#L20 assume ~p <= 0;#res := 1; 36249#partsFINAL assume true; 36248#partsEXIT >#64#return; 35725#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 36242#$Ultimate##0 [2023-02-15 23:14:43,178 INFO L750 eck$LassoCheckResult]: Loop: 36242#$Ultimate##0 ~p := #in~p;~q := #in~q; 36247#L20 assume !(~p <= 0); 36246#L21 assume !(~q <= 0); 36217#L22 assume !(~q > ~p); 35781#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35959#$Ultimate##0 ~p := #in~p;~q := #in~q; 35968#L20 assume ~p <= 0;#res := 1; 35969#partsFINAL assume true; 36237#partsEXIT >#64#return; 35724#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 36242#$Ultimate##0 [2023-02-15 23:14:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:43,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1585293162, now seen corresponding path program 1 times [2023-02-15 23:14:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:43,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776701226] [2023-02-15 23:14:43,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:43,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:43,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1964641052, now seen corresponding path program 1 times [2023-02-15 23:14:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:43,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361817241] [2023-02-15 23:14:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:43,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:43,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash -574602427, now seen corresponding path program 2 times [2023-02-15 23:14:43,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:43,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812322418] [2023-02-15 23:14:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 23:14:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 23:14:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 23:14:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-15 23:14:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812322418] [2023-02-15 23:14:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812322418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757848304] [2023-02-15 23:14:43,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,234 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2023-02-15 23:14:43,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:43,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:43,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:14:43,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 23:14:43,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-15 23:14:43,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757848304] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:43,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:43,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2023-02-15 23:14:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393035722] [2023-02-15 23:14:43,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:43,455 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:43,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:43,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:43,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:43,455 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:43,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:43,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:43,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2023-02-15 23:14:43,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:43,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:43,456 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,457 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,458 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,461 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,497 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:43,497 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,513 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:43,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,535 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:43,535 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:43,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-02-15 23:14:43,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,539 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-02-15 23:14:43,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:43,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,550 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:43,550 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:43,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-02-15 23:14:43,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,554 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-02-15 23:14:43,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:43,557 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,584 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:43,584 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:43,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-02-15 23:14:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,588 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-02-15 23:14:43,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:43,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:43,611 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:43,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-02-15 23:14:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,615 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-02-15 23:14:43,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:43,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-02-15 23:14:43,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,628 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:43,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-02-15 23:14:43,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:43,641 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:43,779 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:43,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-02-15 23:14:43,783 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:43,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:43,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:43,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:43,783 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:43,783 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,783 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:43,783 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:43,783 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2023-02-15 23:14:43,783 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:43,783 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:43,784 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,792 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,793 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,794 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,795 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:43,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:43,823 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:43,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,825 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-02-15 23:14:43,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:43,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:43,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:43,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:43,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:43,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:43,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:43,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:43,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:43,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-02-15 23:14:43,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,841 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-02-15 23:14:43,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:43,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:43,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:43,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:43,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:43,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:43,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:43,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:43,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,854 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-02-15 23:14:43,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:43,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:43,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:43,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:43,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:43,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:43,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:43,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:43,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:43,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2023-02-15 23:14:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,916 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-02-15 23:14:43,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:43,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:43,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:43,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:43,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:43,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:43,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:43,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:43,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:14:43,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2023-02-15 23:14:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,930 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-02-15 23:14:43,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:43,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:43,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:43,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:43,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:43,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:43,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:43,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:43,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:43,952 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:43,952 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:43,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:43,953 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:43,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2023-02-15 23:14:43,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:43,956 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:43,956 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:43,956 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2023-02-15 23:14:43,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:43,972 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:14:44,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:44,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:44,150 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:44,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 570 states and 905 transitions. cyclomatic complexity: 352 Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:44,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 570 states and 905 transitions. cyclomatic complexity: 352. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1746 states and 2836 transitions. Complement of second has 35 states. [2023-02-15 23:14:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:14:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2023-02-15 23:14:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 45 letters. Loop has 10 letters. [2023-02-15 23:14:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 55 letters. Loop has 10 letters. [2023-02-15 23:14:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:44,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 45 letters. Loop has 20 letters. [2023-02-15 23:14:44,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:44,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1746 states and 2836 transitions. [2023-02-15 23:14:44,304 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 151 [2023-02-15 23:14:44,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1746 states to 1356 states and 2220 transitions. [2023-02-15 23:14:44,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2023-02-15 23:14:44,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 404 [2023-02-15 23:14:44,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1356 states and 2220 transitions. [2023-02-15 23:14:44,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:44,315 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1356 states and 2220 transitions. [2023-02-15 23:14:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states and 2220 transitions. [2023-02-15 23:14:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1200. [2023-02-15 23:14:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 845 states have (on average 1.1597633136094674) internal successors, (980), 890 states have internal predecessors, (980), 232 states have call successors, (242), 163 states have call predecessors, (242), 123 states have return successors, (671), 146 states have call predecessors, (671), 207 states have call successors, (671) [2023-02-15 23:14:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1893 transitions. [2023-02-15 23:14:44,339 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1200 states and 1893 transitions. [2023-02-15 23:14:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 23:14:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 23:14:44,340 INFO L87 Difference]: Start difference. First operand 1200 states and 1893 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 23:14:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:44,404 INFO L93 Difference]: Finished difference Result 1474 states and 2233 transitions. [2023-02-15 23:14:44,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2233 transitions. [2023-02-15 23:14:44,410 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 178 [2023-02-15 23:14:44,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1416 states and 2162 transitions. [2023-02-15 23:14:44,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2023-02-15 23:14:44,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 393 [2023-02-15 23:14:44,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1416 states and 2162 transitions. [2023-02-15 23:14:44,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:44,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1416 states and 2162 transitions. [2023-02-15 23:14:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states and 2162 transitions. [2023-02-15 23:14:44,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1348. [2023-02-15 23:14:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 944 states have (on average 1.1588983050847457) internal successors, (1094), 999 states have internal predecessors, (1094), 262 states have call successors, (275), 181 states have call predecessors, (275), 142 states have return successors, (716), 167 states have call predecessors, (716), 231 states have call successors, (716) [2023-02-15 23:14:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2085 transitions. [2023-02-15 23:14:44,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1348 states and 2085 transitions. [2023-02-15 23:14:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:14:44,466 INFO L428 stractBuchiCegarLoop]: Abstraction has 1348 states and 2085 transitions. [2023-02-15 23:14:44,466 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-15 23:14:44,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1348 states and 2085 transitions. [2023-02-15 23:14:44,470 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 166 [2023-02-15 23:14:44,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:44,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:44,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:44,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 23:14:44,471 INFO L748 eck$LassoCheckResult]: Stem: 41378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 41330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 41331#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 41323#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 41324#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 41349#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 41328#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 41329#$Ultimate##0 ~p := #in~p;~q := #in~q; 42648#L20 assume ~p <= 0;#res := 1; 42647#partsFINAL assume true; 42646#partsEXIT >#68#return; 41307#L36-1 havoc main_#t~ret8#1; 41390#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 41496#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 41306#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 41457#$Ultimate##0 ~p := #in~p;~q := #in~q; 41463#L20 assume ~p <= 0;#res := 1; 41459#partsFINAL assume true; 41456#partsEXIT >#68#return; 41455#L36-1 havoc main_#t~ret8#1; 41454#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 41453#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 41452#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 41450#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 41448#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 41445#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 41446#$Ultimate##0 ~p := #in~p;~q := #in~q; 41451#L20 assume !(~p <= 0); 41449#L21 assume ~q <= 0;#res := 0; 41447#partsFINAL assume true; 41444#partsEXIT >#68#return; 41443#L36-1 havoc main_#t~ret8#1; 41442#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 41440#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 41441#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 41787#$Ultimate##0 ~p := #in~p;~q := #in~q; 41784#L20 assume !(~p <= 0); 41781#L21 assume !(~q <= 0); 41776#L22 assume ~q > ~p; 41428#L22-1 call #t~ret0 := parts(~p, ~p);< 41766#$Ultimate##0 ~p := #in~p;~q := #in~q; 41764#L20 assume !(~p <= 0); 41762#L21 assume !(~q <= 0); 41761#L22 assume !(~q > ~p); 41759#L23 call #t~ret1 := parts(~p - ~q, ~q);< 41760#$Ultimate##0 ~p := #in~p;~q := #in~q; 41765#L20 assume ~p <= 0;#res := 1; 41763#partsFINAL assume true; 41758#partsEXIT >#64#return; 41333#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 41748#$Ultimate##0 ~p := #in~p;~q := #in~q; 41749#L20 assume !(~p <= 0); 41819#L21 assume !(~q <= 0); 41342#L22 [2023-02-15 23:14:44,471 INFO L750 eck$LassoCheckResult]: Loop: 41342#L22 assume !(~q > ~p); 41332#L23 call #t~ret1 := parts(~p - ~q, ~q);< 41336#$Ultimate##0 ~p := #in~p;~q := #in~q; 41789#L20 assume !(~p <= 0); 42349#L21 assume !(~q <= 0); 41342#L22 [2023-02-15 23:14:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash -505554686, now seen corresponding path program 1 times [2023-02-15 23:14:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872672053] [2023-02-15 23:14:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 23:14:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 23:14:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 23:14:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872672053] [2023-02-15 23:14:44,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872672053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:44,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183756053] [2023-02-15 23:14:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:44,545 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:44,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-02-15 23:14:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:44,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:14:44,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 23:14:44,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 23:14:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183756053] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:44,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:44,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-02-15 23:14:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985338620] [2023-02-15 23:14:44,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:44,696 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 43435410, now seen corresponding path program 2 times [2023-02-15 23:14:44,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:44,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578325965] [2023-02-15 23:14:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:44,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:44,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:44,764 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:44,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:44,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:44,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:44,764 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:44,764 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:44,764 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:44,764 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:44,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2023-02-15 23:14:44,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:44,765 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:44,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:44,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:44,774 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:44,776 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:44,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:44,809 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:44,809 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:44,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:44,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:44,810 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:44,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-02-15 23:14:44,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:44,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:44,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:44,820 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:44,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:44,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:44,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:44,824 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:44,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-02-15 23:14:44,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:44,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:44,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2023-02-15 23:14:44,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:44,843 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:44,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-02-15 23:14:44,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:44,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:49,311 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:49,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:49,316 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:49,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:49,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:49,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:49,316 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:49,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:49,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:49,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:49,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2023-02-15 23:14:49,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:49,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:49,316 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:49,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:49,325 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:49,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:49,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:49,359 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:49,359 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:49,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:49,361 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-02-15 23:14:49,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:49,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:49,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:49,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:49,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:49,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:49,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:49,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:49,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:49,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:49,389 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:49,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:49,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:49,391 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:49,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-02-15 23:14:49,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:49,394 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:49,394 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:49,394 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2023-02-15 23:14:49,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:49,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:49,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:49,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:49,631 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1403 states and 2145 transitions. Complement of second has 15 states. [2023-02-15 23:14:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2023-02-15 23:14:49,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 23:14:49,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:49,632 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:49,801 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:49,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:49,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1403 states and 2145 transitions. Complement of second has 15 states. [2023-02-15 23:14:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2023-02-15 23:14:49,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 23:14:49,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:49,844 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:49,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:14:49,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:49,964 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2023-02-15 23:14:49,964 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780 Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:50,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1348 states and 2085 transitions. cyclomatic complexity: 780. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1930 states and 2947 transitions. Complement of second has 20 states. [2023-02-15 23:14:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 23:14:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2023-02-15 23:14:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 23:14:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 58 letters. Loop has 5 letters. [2023-02-15 23:14:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 53 letters. Loop has 10 letters. [2023-02-15 23:14:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:50,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1930 states and 2947 transitions. [2023-02-15 23:14:50,043 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 171 [2023-02-15 23:14:50,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1930 states to 1527 states and 2435 transitions. [2023-02-15 23:14:50,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 323 [2023-02-15 23:14:50,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2023-02-15 23:14:50,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1527 states and 2435 transitions. [2023-02-15 23:14:50,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:50,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1527 states and 2435 transitions. [2023-02-15 23:14:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states and 2435 transitions. [2023-02-15 23:14:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1354. [2023-02-15 23:14:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 949 states have (on average 1.1833508956796628) internal successors, (1123), 997 states have internal predecessors, (1123), 267 states have call successors, (280), 190 states have call predecessors, (280), 138 states have return successors, (584), 166 states have call predecessors, (584), 238 states have call successors, (584) [2023-02-15 23:14:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1987 transitions. [2023-02-15 23:14:50,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1354 states and 1987 transitions. [2023-02-15 23:14:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 23:14:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 23:14:50,093 INFO L87 Difference]: Start difference. First operand 1354 states and 1987 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:50,159 INFO L93 Difference]: Finished difference Result 1389 states and 2006 transitions. [2023-02-15 23:14:50,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1389 states and 2006 transitions. [2023-02-15 23:14:50,164 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 163 [2023-02-15 23:14:50,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1389 states to 1367 states and 1981 transitions. [2023-02-15 23:14:50,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2023-02-15 23:14:50,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2023-02-15 23:14:50,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1367 states and 1981 transitions. [2023-02-15 23:14:50,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:50,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1367 states and 1981 transitions. [2023-02-15 23:14:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states and 1981 transitions. [2023-02-15 23:14:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1314. [2023-02-15 23:14:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 922 states have (on average 1.177874186550976) internal successors, (1086), 966 states have internal predecessors, (1086), 257 states have call successors, (267), 185 states have call predecessors, (267), 135 states have return successors, (565), 162 states have call predecessors, (565), 233 states have call successors, (565) [2023-02-15 23:14:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1918 transitions. [2023-02-15 23:14:50,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1314 states and 1918 transitions. [2023-02-15 23:14:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 23:14:50,193 INFO L428 stractBuchiCegarLoop]: Abstraction has 1314 states and 1918 transitions. [2023-02-15 23:14:50,193 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-15 23:14:50,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1314 states and 1918 transitions. [2023-02-15 23:14:50,196 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 153 [2023-02-15 23:14:50,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:50,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:50,196 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:50,196 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:50,197 INFO L748 eck$LassoCheckResult]: Stem: 51154#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 51113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 51114#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 51111#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 51112#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 51130#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 51117#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 51118#$Ultimate##0 ~p := #in~p;~q := #in~q; 52396#L20 assume ~p <= 0;#res := 1; 52395#partsFINAL assume true; 52394#partsEXIT >#68#return; 51092#L36-1 havoc main_#t~ret8#1; 51171#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51258#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 51091#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 51243#$Ultimate##0 ~p := #in~p;~q := #in~q; 51263#L20 assume ~p <= 0;#res := 1; 51199#partsFINAL assume true; 51200#partsEXIT >#68#return; 51242#L36-1 havoc main_#t~ret8#1; 51241#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51240#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 51239#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 51237#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 51235#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 51232#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 51233#$Ultimate##0 ~p := #in~p;~q := #in~q; 51238#L20 assume !(~p <= 0); 51236#L21 assume ~q <= 0;#res := 0; 51234#partsFINAL assume true; 51231#partsEXIT >#68#return; 51230#L36-1 havoc main_#t~ret8#1; 51229#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51227#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 51228#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 51674#$Ultimate##0 ~p := #in~p;~q := #in~q; 51694#L20 assume !(~p <= 0); 51693#L21 assume !(~q <= 0); 51691#L22 assume !(~q > ~p); 51692#L23 call #t~ret1 := parts(~p - ~q, ~q);< 51751#$Ultimate##0 ~p := #in~p;~q := #in~q; 51755#L20 assume ~p <= 0;#res := 1; 51754#partsFINAL assume true; 51750#partsEXIT >#64#return; 51740#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 51743#$Ultimate##0 ~p := #in~p;~q := #in~q; 51753#L20 assume !(~p <= 0); 51752#L21 assume ~q <= 0;#res := 0; 51749#partsFINAL assume true; 51739#partsEXIT >#66#return; 51742#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 51984#partsFINAL assume true; 51983#partsEXIT >#68#return; 51957#L36-1 havoc main_#t~ret8#1; 51643#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51642#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 51178#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 51639#$Ultimate##0 ~p := #in~p;~q := #in~q; 51637#L20 assume !(~p <= 0); 51635#L21 assume !(~q <= 0); 51620#L22 assume !(~q > ~p); 51621#L23 [2023-02-15 23:14:50,197 INFO L750 eck$LassoCheckResult]: Loop: 51621#L23 call #t~ret1 := parts(~p - ~q, ~q);< 51828#$Ultimate##0 ~p := #in~p;~q := #in~q; 51830#L20 assume ~p <= 0;#res := 1; 51829#partsFINAL assume true; 51827#partsEXIT >#64#return; 51343#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 51826#$Ultimate##0 ~p := #in~p;~q := #in~q; 51905#L20 assume !(~p <= 0); 51903#L21 assume !(~q <= 0); 51904#L22 assume !(~q > ~p); 51621#L23 [2023-02-15 23:14:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2104916166, now seen corresponding path program 1 times [2023-02-15 23:14:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:50,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558685653] [2023-02-15 23:14:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 23:14:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 23:14:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-02-15 23:14:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558685653] [2023-02-15 23:14:50,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558685653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096432822] [2023-02-15 23:14:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:50,259 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:50,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2023-02-15 23:14:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:50,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:14:50,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-02-15 23:14:50,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-02-15 23:14:50,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096432822] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:50,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:50,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-15 23:14:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680271836] [2023-02-15 23:14:50,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:50,413 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 328559132, now seen corresponding path program 2 times [2023-02-15 23:14:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:50,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529560032] [2023-02-15 23:14:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:50,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:50,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:50,526 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:50,526 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:50,526 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:50,526 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:50,526 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:50,526 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:50,526 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:50,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:50,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2023-02-15 23:14:50,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:50,526 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:50,527 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:50,532 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:50,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:50,534 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:50,535 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:50,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:50,557 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:50,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:50,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:50,558 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:50,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-02-15 23:14:50,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:50,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:50,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2023-02-15 23:14:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:50,600 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:50,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-02-15 23:14:50,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:50,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:52,817 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:52,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:52,822 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:52,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:52,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:52,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:52,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:52,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:52,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:52,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:52,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2023-02-15 23:14:52,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:52,822 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:52,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:52,832 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:52,833 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:52,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:52,836 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:52,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:52,869 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:52,870 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:52,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-02-15 23:14:52,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:52,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:52,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:52,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:52,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:52,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:52,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:52,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:52,887 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:14:52,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:14:52,889 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:14:52,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:52,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:52,892 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:52,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-02-15 23:14:52,894 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:14:52,894 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:14:52,894 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:14:52,894 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2023-02-15 23:14:52,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-02-15 23:14:52,897 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:14:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:52,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:52,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:53,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:53,192 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:53,192 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:53,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 3596 states and 5408 transitions. Complement of second has 23 states. [2023-02-15 23:14:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2023-02-15 23:14:53,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 23:14:53,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:53,291 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:53,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:53,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:53,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:53,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:53,577 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:53,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:53,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 3488 states and 5294 transitions. Complement of second has 23 states. [2023-02-15 23:14:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2023-02-15 23:14:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 49 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 23:14:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:53,688 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:14:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:53,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:14:53,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:53,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:14:53,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:14:53,964 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2023-02-15 23:14:53,964 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:54,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1314 states and 1918 transitions. cyclomatic complexity: 644. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 6288 states and 8536 transitions. Complement of second has 100 states. [2023-02-15 23:14:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:14:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:14:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2023-02-15 23:14:54,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 23:14:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:54,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 71 letters. Loop has 10 letters. [2023-02-15 23:14:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:54,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 20 letters. [2023-02-15 23:14:54,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:14:54,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6288 states and 8536 transitions. [2023-02-15 23:14:54,155 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 165 [2023-02-15 23:14:54,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6288 states to 2460 states and 3343 transitions. [2023-02-15 23:14:54,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 286 [2023-02-15 23:14:54,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 319 [2023-02-15 23:14:54,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2460 states and 3343 transitions. [2023-02-15 23:14:54,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:54,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2460 states and 3343 transitions. [2023-02-15 23:14:54,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states and 3343 transitions. [2023-02-15 23:14:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1781. [2023-02-15 23:14:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1174 states have (on average 1.141396933560477) internal successors, (1340), 1279 states have internal predecessors, (1340), 418 states have call successors, (476), 253 states have call predecessors, (476), 189 states have return successors, (579), 248 states have call predecessors, (579), 381 states have call successors, (579) [2023-02-15 23:14:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2395 transitions. [2023-02-15 23:14:54,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1781 states and 2395 transitions. [2023-02-15 23:14:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:14:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 23:14:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 23:14:54,218 INFO L87 Difference]: Start difference. First operand 1781 states and 2395 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 23:14:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:14:54,288 INFO L93 Difference]: Finished difference Result 1870 states and 2539 transitions. [2023-02-15 23:14:54,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1870 states and 2539 transitions. [2023-02-15 23:14:54,294 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 167 [2023-02-15 23:14:54,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1870 states to 1849 states and 2514 transitions. [2023-02-15 23:14:54,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2023-02-15 23:14:54,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2023-02-15 23:14:54,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1849 states and 2514 transitions. [2023-02-15 23:14:54,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:14:54,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1849 states and 2514 transitions. [2023-02-15 23:14:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states and 2514 transitions. [2023-02-15 23:14:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1785. [2023-02-15 23:14:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1177 states have (on average 1.141036533559898) internal successors, (1343), 1282 states have internal predecessors, (1343), 419 states have call successors, (477), 253 states have call predecessors, (477), 189 states have return successors, (580), 249 states have call predecessors, (580), 382 states have call successors, (580) [2023-02-15 23:14:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2400 transitions. [2023-02-15 23:14:54,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1785 states and 2400 transitions. [2023-02-15 23:14:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:14:54,338 INFO L428 stractBuchiCegarLoop]: Abstraction has 1785 states and 2400 transitions. [2023-02-15 23:14:54,338 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-15 23:14:54,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1785 states and 2400 transitions. [2023-02-15 23:14:54,342 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 135 [2023-02-15 23:14:54,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:14:54,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:14:54,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:14:54,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-15 23:14:54,343 INFO L748 eck$LassoCheckResult]: Stem: 70739#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 70697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 70698#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 70691#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 70692#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 70755#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 71896#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 71897#$Ultimate##0 ~p := #in~p;~q := #in~q; 71899#L20 assume ~p <= 0;#res := 1; 71898#partsFINAL assume true; 71895#partsEXIT >#68#return; 71893#L36-1 havoc main_#t~ret8#1; 71892#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 70712#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 70695#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 70696#$Ultimate##0 ~p := #in~p;~q := #in~q; 72378#L20 assume ~p <= 0;#res := 1; 72377#partsFINAL assume true; 72376#partsEXIT >#68#return; 72374#L36-1 havoc main_#t~ret8#1; 71142#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 71139#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 71133#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 71134#$Ultimate##0 ~p := #in~p;~q := #in~q; 71136#L20 assume ~p <= 0;#res := 1; 71135#partsFINAL assume true; 71132#partsEXIT >#68#return; 71130#L36-1 havoc main_#t~ret8#1; 71126#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 71125#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 71124#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 71123#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 71122#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 71107#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 71108#$Ultimate##0 ~p := #in~p;~q := #in~q; 71121#L20 assume !(~p <= 0); 71118#L21 assume ~q <= 0;#res := 0; 71115#partsFINAL assume true; 71106#partsEXIT >#68#return; 71089#L36-1 havoc main_#t~ret8#1; 71082#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 71079#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 71074#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 71076#$Ultimate##0 ~p := #in~p;~q := #in~q; 71100#L20 assume !(~p <= 0); 71098#L21 assume !(~q <= 0); 71095#L22 assume !(~q > ~p); 71092#L23 call #t~ret1 := parts(~p - ~q, ~q);< 71093#$Ultimate##0 ~p := #in~p;~q := #in~q; 71109#L20 assume ~p <= 0;#res := 1; 71101#partsFINAL assume true; 71091#partsEXIT >#64#return; 71084#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 71085#$Ultimate##0 ~p := #in~p;~q := #in~q; 71119#L20 assume !(~p <= 0); 71116#L21 assume ~q <= 0;#res := 0; 71090#partsFINAL assume true; 71083#partsEXIT >#66#return; 71080#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 71077#partsFINAL assume true; 71073#partsEXIT >#68#return; 71067#L36-1 havoc main_#t~ret8#1; 71063#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 71062#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 70672#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 70991#$Ultimate##0 ~p := #in~p;~q := #in~q; 70986#L20 assume !(~p <= 0); 70983#L21 assume !(~q <= 0); 70947#L22 assume !(~q > ~p); 70893#L23 call #t~ret1 := parts(~p - ~q, ~q);< 70961#$Ultimate##0 ~p := #in~p;~q := #in~q; 71017#L20 assume !(~p <= 0); 70993#L21 assume !(~q <= 0); 70994#L22 assume !(~q > ~p); 71030#L23 [2023-02-15 23:14:54,343 INFO L750 eck$LassoCheckResult]: Loop: 71030#L23 call #t~ret1 := parts(~p - ~q, ~q);< 71055#$Ultimate##0 ~p := #in~p;~q := #in~q; 71058#L20 assume ~p <= 0;#res := 1; 71057#partsFINAL assume true; 71053#partsEXIT >#64#return; 71026#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 71042#$Ultimate##0 ~p := #in~p;~q := #in~q; 71034#L20 assume !(~p <= 0); 71033#L21 assume !(~q <= 0); 71028#L22 assume !(~q > ~p); 70949#L23 call #t~ret1 := parts(~p - ~q, ~q);< 70961#$Ultimate##0 ~p := #in~p;~q := #in~q; 71017#L20 assume !(~p <= 0); 70993#L21 assume !(~q <= 0); 70994#L22 assume !(~q > ~p); 71030#L23 [2023-02-15 23:14:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -73967836, now seen corresponding path program 2 times [2023-02-15 23:14:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:54,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679204678] [2023-02-15 23:14:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:54,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:14:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:14:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:14:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 23:14:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 23:14:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:14:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:14:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:14:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 49 proven. 34 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-15 23:14:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:14:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679204678] [2023-02-15 23:14:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679204678] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:14:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262834236] [2023-02-15 23:14:54,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:14:54,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:14:54,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:54,449 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:14:54,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2023-02-15 23:14:54,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:14:54,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:14:54,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:14:54,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:14:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 49 proven. 34 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-15 23:14:54,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:14:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 49 proven. 34 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-15 23:14:54,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262834236] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:14:54,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:14:54,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 23:14:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587109108] [2023-02-15 23:14:54,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:14:54,656 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:14:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:14:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -159621075, now seen corresponding path program 3 times [2023-02-15 23:14:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:14:54,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544712301] [2023-02-15 23:14:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:14:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:14:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:54,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:14:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:14:54,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:14:54,868 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:54,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:54,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:54,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:54,869 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:14:54,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:54,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:54,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:54,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2023-02-15 23:14:54,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:54,869 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:54,869 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:54,871 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:54,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:54,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:54,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:54,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:54,923 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:14:54,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:54,925 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:54,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-02-15 23:14:54,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:54,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:54,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:14:54,941 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:14:54,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:54,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:54,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:54,944 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:54,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-02-15 23:14:54,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:14:54,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:54,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:54,968 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:54,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-02-15 23:14:54,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:14:54,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:14:59,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:14:59,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2023-02-15 23:14:59,920 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:14:59,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:14:59,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:14:59,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:14:59,921 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:14:59,921 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:59,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:14:59,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:14:59,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2023-02-15 23:14:59,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:14:59,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:14:59,921 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:59,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:59,924 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:59,925 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:59,935 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:14:59,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:14:59,972 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:14:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:14:59,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:14:59,973 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:14:59,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-02-15 23:14:59,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:14:59,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:14:59,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:14:59,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:14:59,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:14:59,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:14:59,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:14:59,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:14:59,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:00,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:00,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:00,002 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:00,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-02-15 23:15:00,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:00,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:00,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:00,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:00,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:00,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:00,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:00,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:00,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:00,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:00,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:00,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:00,031 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:00,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-02-15 23:15:00,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:00,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:00,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:00,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:00,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:00,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:00,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:00,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:00,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:00,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:00,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:00,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:00,047 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-02-15 23:15:00,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:00,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:00,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:00,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:00,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:00,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:00,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:00,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:00,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:00,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:00,065 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:15:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:00,071 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:00,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-02-15 23:15:00,072 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:00,072 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:00,072 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:00,072 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2023-02-15 23:15:00,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:00,076 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:00,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 23:15:00,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:15:00,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:15:00,387 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-15 23:15:00,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:00,590 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4321 states and 5509 transitions. Complement of second has 46 states. [2023-02-15 23:15:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2023-02-15 23:15:00,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 74 letters. Loop has 15 letters. [2023-02-15 23:15:00,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:00,591 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:00,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 23:15:00,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:00,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:00,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:15:00,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:15:00,913 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-15 23:15:00,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:01,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 4491 states and 5839 transitions. Complement of second has 48 states. [2023-02-15 23:15:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2023-02-15 23:15:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 60 transitions. Stem has 74 letters. Loop has 15 letters. [2023-02-15 23:15:01,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:01,116 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:01,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 23:15:01,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:01,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:15:01,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:15:01,466 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-15 23:15:01,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657 Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:01,690 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1785 states and 2400 transitions. cyclomatic complexity: 657. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 9815 states and 12940 transitions. Complement of second has 271 states. [2023-02-15 23:15:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 5 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 23:15:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2023-02-15 23:15:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 74 letters. Loop has 15 letters. [2023-02-15 23:15:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 89 letters. Loop has 15 letters. [2023-02-15 23:15:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 74 letters. Loop has 30 letters. [2023-02-15 23:15:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:01,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9815 states and 12940 transitions. [2023-02-15 23:15:01,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 23:15:01,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9815 states to 2147 states and 3078 transitions. [2023-02-15 23:15:01,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2023-02-15 23:15:01,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2023-02-15 23:15:01,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2147 states and 3078 transitions. [2023-02-15 23:15:01,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:01,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2147 states and 3078 transitions. [2023-02-15 23:15:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states and 3078 transitions. [2023-02-15 23:15:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1791. [2023-02-15 23:15:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1179 states have (on average 1.164546225614928) internal successors, (1373), 1306 states have internal predecessors, (1373), 417 states have call successors, (437), 237 states have call predecessors, (437), 195 states have return successors, (637), 247 states have call predecessors, (637), 417 states have call successors, (637) [2023-02-15 23:15:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2447 transitions. [2023-02-15 23:15:01,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1791 states and 2447 transitions. [2023-02-15 23:15:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 23:15:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-02-15 23:15:01,774 INFO L87 Difference]: Start difference. First operand 1791 states and 2447 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 23:15:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:01,919 INFO L93 Difference]: Finished difference Result 1551 states and 2029 transitions. [2023-02-15 23:15:01,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1551 states and 2029 transitions. [2023-02-15 23:15:01,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 23:15:01,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1551 states to 1547 states and 2025 transitions. [2023-02-15 23:15:01,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-15 23:15:01,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2023-02-15 23:15:01,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1547 states and 2025 transitions. [2023-02-15 23:15:01,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:01,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1547 states and 2025 transitions. [2023-02-15 23:15:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states and 2025 transitions. [2023-02-15 23:15:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1528. [2023-02-15 23:15:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1016 states have (on average 1.1368110236220472) internal successors, (1155), 1119 states have internal predecessors, (1155), 343 states have call successors, (359), 198 states have call predecessors, (359), 169 states have return successors, (488), 210 states have call predecessors, (488), 343 states have call successors, (488) [2023-02-15 23:15:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2002 transitions. [2023-02-15 23:15:01,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1528 states and 2002 transitions. [2023-02-15 23:15:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 23:15:01,978 INFO L428 stractBuchiCegarLoop]: Abstraction has 1528 states and 2002 transitions. [2023-02-15 23:15:01,978 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-15 23:15:01,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1528 states and 2002 transitions. [2023-02-15 23:15:01,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-15 23:15:01,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:01,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:01,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:01,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:01,982 INFO L748 eck$LassoCheckResult]: Stem: 96238#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 96197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 96198#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 96195#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 96196#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96263#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96313#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96314#$Ultimate##0 ~p := #in~p;~q := #in~q; 96316#L20 assume ~p <= 0;#res := 1; 96315#partsFINAL assume true; 96312#partsEXIT >#68#return; 96311#L36-1 havoc main_#t~ret8#1; 96310#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96307#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96302#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96304#$Ultimate##0 ~p := #in~p;~q := #in~q; 96308#L20 assume ~p <= 0;#res := 1; 96305#partsFINAL assume true; 96301#partsEXIT >#68#return; 96300#L36-1 havoc main_#t~ret8#1; 96299#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96298#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96293#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96295#$Ultimate##0 ~p := #in~p;~q := #in~q; 96297#L20 assume ~p <= 0;#res := 1; 96296#partsFINAL assume true; 96292#partsEXIT >#68#return; 96291#L36-1 havoc main_#t~ret8#1; 96288#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96285#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 96283#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96281#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96277#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96272#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96273#$Ultimate##0 ~p := #in~p;~q := #in~q; 96289#L20 assume !(~p <= 0); 96278#L21 assume ~q <= 0;#res := 0; 96279#partsFINAL assume true; 96271#partsEXIT >#68#return; 96253#L36-1 havoc main_#t~ret8#1; 96254#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96280#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96286#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96403#$Ultimate##0 ~p := #in~p;~q := #in~q; 96422#L20 assume !(~p <= 0); 96421#L21 assume !(~q <= 0); 96417#L22 assume !(~q > ~p); 96413#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96414#$Ultimate##0 ~p := #in~p;~q := #in~q; 96420#L20 assume ~p <= 0;#res := 1; 96416#partsFINAL assume true; 96412#partsEXIT >#64#return; 96409#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96410#$Ultimate##0 ~p := #in~p;~q := #in~q; 96419#L20 assume !(~p <= 0); 96415#L21 assume ~q <= 0;#res := 0; 96411#partsFINAL assume true; 96408#partsEXIT >#66#return; 96407#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96406#partsFINAL assume true; 96402#partsEXIT >#68#return; 96400#L36-1 havoc main_#t~ret8#1; 96399#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96397#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96318#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96392#$Ultimate##0 ~p := #in~p;~q := #in~q; 96389#L20 assume !(~p <= 0); 96388#L21 assume !(~q <= 0); 96387#L22 assume ~q > ~p; 96330#L22-1 call #t~ret0 := parts(~p, ~p);< 96383#$Ultimate##0 ~p := #in~p;~q := #in~q; 96384#L20 assume !(~p <= 0); 96396#L21 assume !(~q <= 0); 96358#L22 assume !(~q > ~p); 96359#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96376#$Ultimate##0 ~p := #in~p;~q := #in~q; 96398#L20 assume ~p <= 0;#res := 1; 96360#partsFINAL assume true; 96361#partsEXIT >#64#return; 96341#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96350#$Ultimate##0 ~p := #in~p;~q := #in~q; 96357#L20 assume !(~p <= 0); 96356#L21 assume ~q <= 0;#res := 0; 96351#partsFINAL assume true; 96340#partsEXIT >#66#return; 96342#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96336#partsFINAL assume true; 96337#partsEXIT >#62#return; 96810#L22-2 #res := #t~ret0;havoc #t~ret0; 96808#partsFINAL assume true; 96806#partsEXIT >#68#return; 96804#L36-1 [2023-02-15 23:15:01,983 INFO L750 eck$LassoCheckResult]: Loop: 96804#L36-1 havoc main_#t~ret8#1; 96266#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96267#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 96209#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96210#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96639#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96201#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96202#$Ultimate##0 ~p := #in~p;~q := #in~q; 96640#L20 assume !(~p <= 0); 96638#L21 assume ~q <= 0;#res := 0; 96637#partsFINAL assume true; 96635#partsEXIT >#68#return; 96633#L36-1 havoc main_#t~ret8#1; 96631#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96630#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96538#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96546#$Ultimate##0 ~p := #in~p;~q := #in~q; 96750#L20 assume !(~p <= 0); 96748#L21 assume !(~q <= 0); 96743#L22 assume !(~q > ~p); 96741#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96742#$Ultimate##0 ~p := #in~p;~q := #in~q; 96747#L20 assume ~p <= 0;#res := 1; 96746#partsFINAL assume true; 96740#partsEXIT >#64#return; 96618#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96619#$Ultimate##0 ~p := #in~p;~q := #in~q; 96645#L20 assume !(~p <= 0); 96642#L21 assume ~q <= 0;#res := 0; 96641#partsFINAL assume true; 96617#partsEXIT >#66#return; 96613#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96611#partsFINAL assume true; 96545#partsEXIT >#68#return; 96541#L36-1 havoc main_#t~ret8#1; 96539#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96529#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96323#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96522#$Ultimate##0 ~p := #in~p;~q := #in~q; 96812#L20 assume !(~p <= 0); 96811#L21 assume !(~q <= 0); 96774#L22 assume ~q > ~p; 96332#L22-1 call #t~ret0 := parts(~p, ~p);< 96335#$Ultimate##0 ~p := #in~p;~q := #in~q; 96405#L20 assume !(~p <= 0); 96365#L21 assume !(~q <= 0); 96366#L22 assume !(~q > ~p); 96353#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96354#$Ultimate##0 ~p := #in~p;~q := #in~q; 96367#L20 assume ~p <= 0;#res := 1; 96368#partsFINAL assume true; 96352#partsEXIT >#64#return; 96341#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96350#$Ultimate##0 ~p := #in~p;~q := #in~q; 96357#L20 assume !(~p <= 0); 96356#L21 assume ~q <= 0;#res := 0; 96351#partsFINAL assume true; 96340#partsEXIT >#66#return; 96342#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96336#partsFINAL assume true; 96337#partsEXIT >#62#return; 96809#L22-2 #res := #t~ret0;havoc #t~ret0; 96807#partsFINAL assume true; 96805#partsEXIT >#68#return; 96804#L36-1 [2023-02-15 23:15:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 1 times [2023-02-15 23:15:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:01,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800696604] [2023-02-15 23:15:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:01,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:01,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1566345406, now seen corresponding path program 1 times [2023-02-15 23:15:01,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:01,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869646964] [2023-02-15 23:15:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:02,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:02,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -432935168, now seen corresponding path program 2 times [2023-02-15 23:15:02,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813415843] [2023-02-15 23:15:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 23:15:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 23:15:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 23:15:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-02-15 23:15:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-02-15 23:15:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-02-15 23:15:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 169 proven. 82 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-02-15 23:15:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813415843] [2023-02-15 23:15:02,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813415843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532589323] [2023-02-15 23:15:02,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:15:02,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:02,162 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:02,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2023-02-15 23:15:02,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:15:02,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:02,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:15:02,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 495 proven. 10 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2023-02-15 23:15:02,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 169 proven. 82 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2023-02-15 23:15:02,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532589323] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:02,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:02,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-02-15 23:15:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044506643] [2023-02-15 23:15:02,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:03,062 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:03,062 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:03,062 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:03,062 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:03,062 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:15:03,062 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,062 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:03,062 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:03,062 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2023-02-15 23:15:03,062 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:03,062 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:03,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,068 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,069 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,071 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,073 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:03,104 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:15:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,105 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-02-15 23:15:03,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:03,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,120 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:03,120 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Honda state: {ULTIMATE.start_main_~x~0#1=2, ULTIMATE.start_main_~q~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:03,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,124 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-02-15 23:15:03,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:03,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:03,149 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:03,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,153 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-02-15 23:15:03,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:03,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,177 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:03,177 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=1} Honda state: {ULTIMATE.start_main_#t~ret8#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:03,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,181 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-02-15 23:15:03,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:03,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,205 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:03,205 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:03,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,209 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-02-15 23:15:03,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:03,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,222 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-02-15 23:15:03,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:15:03,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:03,253 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:15:03,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,256 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:03,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:03,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:03,256 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:03,256 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:15:03,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:03,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:03,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration18_Loop [2023-02-15 23:15:03,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:03,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:03,257 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,258 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:03,318 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:03,318 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:15:03,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,320 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-02-15 23:15:03,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:03,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:03,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:03,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:03,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:03,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:03,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:03,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:03,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:03,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,334 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-02-15 23:15:03,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:03,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:03,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:03,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:03,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:03,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:03,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:03,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:03,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:03,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,349 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-02-15 23:15:03,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:03,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:03,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:03,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:03,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:03,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:03,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:03,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:03,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:03,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,362 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-02-15 23:15:03,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:03,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:03,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:03,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:03,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:03,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:03,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:03,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:03,373 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:03,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:03,374 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:15:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:03,376 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:03,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-02-15 23:15:03,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:03,378 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:03,378 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:03,378 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2023-02-15 23:15:03,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:03,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 23:15:03,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:03,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:03,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 23:15:03,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-15 23:15:03,968 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2023-02-15 23:15:03,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1528 states and 2002 transitions. cyclomatic complexity: 498 Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-15 23:15:04,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1528 states and 2002 transitions. cyclomatic complexity: 498. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Result 3499 states and 4660 transitions. Complement of second has 53 states. [2023-02-15 23:15:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-15 23:15:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2023-02-15 23:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 91 letters. Loop has 64 letters. [2023-02-15 23:15:04,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 155 letters. Loop has 64 letters. [2023-02-15 23:15:04,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:04,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 70 transitions. Stem has 91 letters. Loop has 128 letters. [2023-02-15 23:15:04,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:04,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3499 states and 4660 transitions. [2023-02-15 23:15:04,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-02-15 23:15:04,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3499 states to 2016 states and 2616 transitions. [2023-02-15 23:15:04,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2023-02-15 23:15:04,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2023-02-15 23:15:04,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2016 states and 2616 transitions. [2023-02-15 23:15:04,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:04,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2016 states and 2616 transitions. [2023-02-15 23:15:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states and 2616 transitions. [2023-02-15 23:15:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1889. [2023-02-15 23:15:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1277 states have (on average 1.1174628034455756) internal successors, (1427), 1386 states have internal predecessors, (1427), 403 states have call successors, (429), 240 states have call predecessors, (429), 209 states have return successors, (568), 262 states have call predecessors, (568), 403 states have call successors, (568) [2023-02-15 23:15:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2424 transitions. [2023-02-15 23:15:04,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1889 states and 2424 transitions. [2023-02-15 23:15:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 23:15:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-02-15 23:15:04,177 INFO L87 Difference]: Start difference. First operand 1889 states and 2424 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 13 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2023-02-15 23:15:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:04,341 INFO L93 Difference]: Finished difference Result 1882 states and 2450 transitions. [2023-02-15 23:15:04,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1882 states and 2450 transitions. [2023-02-15 23:15:04,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-02-15 23:15:04,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1882 states to 1688 states and 2236 transitions. [2023-02-15 23:15:04,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2023-02-15 23:15:04,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2023-02-15 23:15:04,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 2236 transitions. [2023-02-15 23:15:04,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:04,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1688 states and 2236 transitions. [2023-02-15 23:15:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 2236 transitions. [2023-02-15 23:15:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1629. [2023-02-15 23:15:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1088 states have (on average 1.1286764705882353) internal successors, (1228), 1193 states have internal predecessors, (1228), 361 states have call successors, (380), 210 states have call predecessors, (380), 180 states have return successors, (510), 225 states have call predecessors, (510), 361 states have call successors, (510) [2023-02-15 23:15:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2118 transitions. [2023-02-15 23:15:04,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1629 states and 2118 transitions. [2023-02-15 23:15:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 23:15:04,377 INFO L428 stractBuchiCegarLoop]: Abstraction has 1629 states and 2118 transitions. [2023-02-15 23:15:04,377 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-02-15 23:15:04,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1629 states and 2118 transitions. [2023-02-15 23:15:04,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2023-02-15 23:15:04,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:04,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:04,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:04,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-02-15 23:15:04,382 INFO L748 eck$LassoCheckResult]: Stem: 106724#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 106679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 106680#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 106677#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 106678#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 106777#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106774#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 106775#$Ultimate##0 ~p := #in~p;~q := #in~q; 106778#L20 assume ~p <= 0;#res := 1; 106776#partsFINAL assume true; 106773#partsEXIT >#68#return; 106771#L36-1 havoc main_#t~ret8#1; 106770#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106767#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106762#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 106764#$Ultimate##0 ~p := #in~p;~q := #in~q; 106768#L20 assume ~p <= 0;#res := 1; 106765#partsFINAL assume true; 106761#partsEXIT >#68#return; 106760#L36-1 havoc main_#t~ret8#1; 106759#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106757#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106753#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 106754#$Ultimate##0 ~p := #in~p;~q := #in~q; 106758#L20 assume ~p <= 0;#res := 1; 106756#partsFINAL assume true; 106752#partsEXIT >#68#return; 106751#L36-1 havoc main_#t~ret8#1; 106750#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106749#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 106691#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 106692#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 106748#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 107033#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107034#$Ultimate##0 ~p := #in~p;~q := #in~q; 107044#L20 assume !(~p <= 0); 107042#L21 assume ~q <= 0;#res := 0; 107040#partsFINAL assume true; 107032#partsEXIT >#68#return; 107027#L36-1 havoc main_#t~ret8#1; 107023#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107021#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 107018#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107019#$Ultimate##0 ~p := #in~p;~q := #in~q; 107043#L20 assume !(~p <= 0); 107041#L21 assume !(~q <= 0); 107039#L22 assume !(~q > ~p); 107030#L23 call #t~ret1 := parts(~p - ~q, ~q);< 107031#$Ultimate##0 ~p := #in~p;~q := #in~q; 107038#L20 assume ~p <= 0;#res := 1; 107037#partsFINAL assume true; 107029#partsEXIT >#64#return; 107025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 107026#$Ultimate##0 ~p := #in~p;~q := #in~q; 107036#L20 assume !(~p <= 0); 107035#L21 assume ~q <= 0;#res := 0; 107028#partsFINAL assume true; 107024#partsEXIT >#66#return; 107022#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 107020#partsFINAL assume true; 107017#partsEXIT >#68#return; 107016#L36-1 havoc main_#t~ret8#1; 107015#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107014#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106787#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107012#$Ultimate##0 ~p := #in~p;~q := #in~q; 107011#L20 assume !(~p <= 0); 107010#L21 assume !(~q <= 0); 107009#L22 assume ~q > ~p; 106998#L22-1 call #t~ret0 := parts(~p, ~p);< 107007#$Ultimate##0 ~p := #in~p;~q := #in~q; 107008#L20 assume !(~p <= 0); 108003#L21 assume !(~q <= 0); 108002#L22 assume !(~q > ~p); 107990#L23 call #t~ret1 := parts(~p - ~q, ~q);< 107992#$Ultimate##0 ~p := #in~p;~q := #in~q; 108000#L20 assume ~p <= 0;#res := 1; 107999#partsFINAL assume true; 107989#partsEXIT >#64#return; 107976#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 107977#$Ultimate##0 ~p := #in~p;~q := #in~q; 107983#L20 assume !(~p <= 0); 107981#L21 assume ~q <= 0;#res := 0; 107979#partsFINAL assume true; 107975#partsEXIT >#66#return; 107973#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 107971#partsFINAL assume true; 107965#partsEXIT >#62#return; 107963#L22-2 #res := #t~ret0;havoc #t~ret0; 107961#partsFINAL assume true; 107957#partsEXIT >#68#return; 107952#L36-1 [2023-02-15 23:15:04,382 INFO L750 eck$LassoCheckResult]: Loop: 107952#L36-1 havoc main_#t~ret8#1; 106781#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106782#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 106689#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 106690#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 107944#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 107196#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107943#$Ultimate##0 ~p := #in~p;~q := #in~q; 107203#L20 assume !(~p <= 0); 107204#L21 assume ~q <= 0;#res := 0; 107195#partsFINAL assume true; 107197#partsEXIT >#68#return; 107140#L36-1 havoc main_#t~ret8#1; 107141#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107086#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106830#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 106841#$Ultimate##0 ~p := #in~p;~q := #in~q; 107559#L20 assume !(~p <= 0); 107555#L21 assume ~q <= 0;#res := 0; 107556#partsFINAL assume true; 106840#partsEXIT >#68#return; 106837#L36-1 havoc main_#t~ret8#1; 106838#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106829#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106831#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107803#$Ultimate##0 ~p := #in~p;~q := #in~q; 107864#L20 assume !(~p <= 0); 107207#L21 assume !(~q <= 0); 107208#L22 assume ~q > ~p; 107818#L22-1 call #t~ret0 := parts(~p, ~p);< 107821#$Ultimate##0 ~p := #in~p;~q := #in~q; 107923#L20 assume !(~p <= 0); 107922#L21 assume !(~q <= 0); 107921#L22 assume !(~q > ~p); 107844#L23 call #t~ret1 := parts(~p - ~q, ~q);< 107871#$Ultimate##0 ~p := #in~p;~q := #in~q; 107880#L20 assume ~p <= 0;#res := 1; 107879#partsFINAL assume true; 107870#partsEXIT >#64#return; 107829#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 107832#$Ultimate##0 ~p := #in~p;~q := #in~q; 107882#L20 assume !(~p <= 0); 107881#L21 assume ~q <= 0;#res := 0; 107868#partsFINAL assume true; 107828#partsEXIT >#66#return; 107831#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 107847#partsFINAL assume true; 107815#partsEXIT >#62#return; 107814#L22-2 #res := #t~ret0;havoc #t~ret0; 107813#partsFINAL assume true; 107799#partsEXIT >#68#return; 107795#L36-1 havoc main_#t~ret8#1; 107796#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107242#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 106835#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 107804#$Ultimate##0 ~p := #in~p;~q := #in~q; 107987#L20 assume !(~p <= 0); 107986#L21 assume !(~q <= 0); 107968#L22 assume ~q > ~p; 106992#L22-1 call #t~ret0 := parts(~p, ~p);< 107967#$Ultimate##0 ~p := #in~p;~q := #in~q; 107051#L20 assume !(~p <= 0); 107052#L21 assume !(~q <= 0); 106989#L22 assume !(~q > ~p); 106959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 107991#$Ultimate##0 ~p := #in~p;~q := #in~q; 108001#L20 assume ~p <= 0;#res := 1; 107996#partsFINAL assume true; 107988#partsEXIT >#64#return; 107976#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 107977#$Ultimate##0 ~p := #in~p;~q := #in~q; 107983#L20 assume !(~p <= 0); 107981#L21 assume ~q <= 0;#res := 0; 107979#partsFINAL assume true; 107975#partsEXIT >#66#return; 107973#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 107971#partsFINAL assume true; 107965#partsEXIT >#62#return; 107962#L22-2 #res := #t~ret0;havoc #t~ret0; 107960#partsFINAL assume true; 107955#partsEXIT >#68#return; 107952#L36-1 [2023-02-15 23:15:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 3 times [2023-02-15 23:15:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:04,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390542140] [2023-02-15 23:15:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:04,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:04,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1358309140, now seen corresponding path program 2 times [2023-02-15 23:15:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:04,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268397925] [2023-02-15 23:15:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 23:15:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 23:15:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 23:15:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-02-15 23:15:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268397925] [2023-02-15 23:15:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268397925] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902223572] [2023-02-15 23:15:04,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:15:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:04,445 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:04,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2023-02-15 23:15:04,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:15:04,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:04,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 23:15:04,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2023-02-15 23:15:04,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:15:04,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902223572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:15:04,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 23:15:04,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-02-15 23:15:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483309747] [2023-02-15 23:15:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:15:04,501 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:15:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:15:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 23:15:04,501 INFO L87 Difference]: Start difference. First operand 1629 states and 2118 transitions. cyclomatic complexity: 516 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 23:15:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:04,556 INFO L93 Difference]: Finished difference Result 1199 states and 1517 transitions. [2023-02-15 23:15:04,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1199 states and 1517 transitions. [2023-02-15 23:15:04,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-15 23:15:04,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1199 states to 1087 states and 1360 transitions. [2023-02-15 23:15:04,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-15 23:15:04,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2023-02-15 23:15:04,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1087 states and 1360 transitions. [2023-02-15 23:15:04,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:04,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1087 states and 1360 transitions. [2023-02-15 23:15:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states and 1360 transitions. [2023-02-15 23:15:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1063. [2023-02-15 23:15:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 719 states have (on average 1.109874826147427) internal successors, (798), 780 states have internal predecessors, (798), 223 states have call successors, (234), 137 states have call predecessors, (234), 121 states have return successors, (299), 145 states have call predecessors, (299), 223 states have call successors, (299) [2023-02-15 23:15:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1331 transitions. [2023-02-15 23:15:04,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1063 states and 1331 transitions. [2023-02-15 23:15:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:15:04,577 INFO L428 stractBuchiCegarLoop]: Abstraction has 1063 states and 1331 transitions. [2023-02-15 23:15:04,577 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-02-15 23:15:04,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1063 states and 1331 transitions. [2023-02-15 23:15:04,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-15 23:15:04,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:04,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:04,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:04,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [25, 25, 20, 11, 10, 10, 10, 10, 10, 10, 9, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:04,580 INFO L748 eck$LassoCheckResult]: Stem: 109914#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 109866#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 109867#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 109864#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 109865#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 109957#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109954#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109955#$Ultimate##0 ~p := #in~p;~q := #in~q; 109958#L20 assume ~p <= 0;#res := 1; 109956#partsFINAL assume true; 109953#partsEXIT >#68#return; 109951#L36-1 havoc main_#t~ret8#1; 109950#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109947#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109942#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109944#$Ultimate##0 ~p := #in~p;~q := #in~q; 109948#L20 assume ~p <= 0;#res := 1; 109945#partsFINAL assume true; 109941#partsEXIT >#68#return; 109940#L36-1 havoc main_#t~ret8#1; 109939#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109937#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109933#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109935#$Ultimate##0 ~p := #in~p;~q := #in~q; 109938#L20 assume ~p <= 0;#res := 1; 109936#partsFINAL assume true; 109932#partsEXIT >#68#return; 109931#L36-1 havoc main_#t~ret8#1; 109930#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109929#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 109880#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 109881#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 109928#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109981#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109986#$Ultimate##0 ~p := #in~p;~q := #in~q; 110083#L20 assume !(~p <= 0); 110078#L21 assume ~q <= 0;#res := 0; 110072#partsFINAL assume true; 109980#partsEXIT >#68#return; 109982#L36-1 havoc main_#t~ret8#1; 109975#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109976#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110367#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110368#$Ultimate##0 ~p := #in~p;~q := #in~q; 110384#L20 assume !(~p <= 0); 110383#L21 assume !(~q <= 0); 110380#L22 assume !(~q > ~p); 110376#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110377#$Ultimate##0 ~p := #in~p;~q := #in~q; 110382#L20 assume ~p <= 0;#res := 1; 110379#partsFINAL assume true; 110375#partsEXIT >#64#return; 110372#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110373#$Ultimate##0 ~p := #in~p;~q := #in~q; 110381#L20 assume !(~p <= 0); 110378#L21 assume ~q <= 0;#res := 0; 110374#partsFINAL assume true; 110371#partsEXIT >#66#return; 110370#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110369#partsFINAL assume true; 110366#partsEXIT >#68#return; 110365#L36-1 havoc main_#t~ret8#1; 110364#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110363#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110274#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110361#$Ultimate##0 ~p := #in~p;~q := #in~q; 110360#L20 assume !(~p <= 0); 110359#L21 assume !(~q <= 0); 110358#L22 assume ~q > ~p; 110254#L22-1 call #t~ret0 := parts(~p, ~p);< 110357#$Ultimate##0 ~p := #in~p;~q := #in~q; 110355#L20 assume !(~p <= 0); 110353#L21 assume !(~q <= 0); 110349#L22 assume !(~q > ~p); 110341#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110345#$Ultimate##0 ~p := #in~p;~q := #in~q; 110483#L20 assume ~p <= 0;#res := 1; 110482#partsFINAL assume true; 110477#partsEXIT >#64#return; 110474#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110475#$Ultimate##0 ~p := #in~p;~q := #in~q; 110496#L20 assume !(~p <= 0); 110495#L21 assume ~q <= 0;#res := 0; 110491#partsFINAL assume true; 110473#partsEXIT >#66#return; 110472#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110471#partsFINAL assume true; 110454#partsEXIT >#62#return; 110451#L22-2 #res := #t~ret0;havoc #t~ret0; 110450#partsFINAL assume true; 110387#partsEXIT >#68#return; 109924#L36-1 [2023-02-15 23:15:04,580 INFO L750 eck$LassoCheckResult]: Loop: 109924#L36-1 havoc main_#t~ret8#1; 109925#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109959#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 109878#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 109879#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 109882#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109883#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109966#$Ultimate##0 ~p := #in~p;~q := #in~q; 109970#L20 assume !(~p <= 0); 109969#L21 assume ~q <= 0;#res := 0; 109968#partsFINAL assume true; 109965#partsEXIT >#68#return; 109960#L36-1 havoc main_#t~ret8#1; 109915#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109916#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109967#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109995#$Ultimate##0 ~p := #in~p;~q := #in~q; 110063#L20 assume !(~p <= 0); 110057#L21 assume !(~q <= 0); 110055#L22 assume !(~q > ~p); 110052#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110053#$Ultimate##0 ~p := #in~p;~q := #in~q; 110244#L20 assume !(~p <= 0); 110242#L21 assume !(~q <= 0); 110236#L22 assume !(~q > ~p); 110080#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110082#$Ultimate##0 ~p := #in~p;~q := #in~q; 110494#L20 assume !(~p <= 0); 110490#L21 assume !(~q <= 0); 110436#L22 assume !(~q > ~p); 110081#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110082#$Ultimate##0 ~p := #in~p;~q := #in~q; 110494#L20 assume !(~p <= 0); 110490#L21 assume !(~q <= 0); 110436#L22 assume !(~q > ~p); 110437#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110442#$Ultimate##0 ~p := #in~p;~q := #in~q; 110440#L20 assume ~p <= 0;#res := 1; 110441#partsFINAL assume true; 110447#partsEXIT >#64#return; 110074#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110077#$Ultimate##0 ~p := #in~p;~q := #in~q; 110092#L20 assume !(~p <= 0); 110091#L21 assume ~q <= 0;#res := 0; 110090#partsFINAL assume true; 110073#partsEXIT >#66#return; 110076#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110439#partsFINAL assume true; 110079#partsEXIT >#64#return; 110074#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110077#$Ultimate##0 ~p := #in~p;~q := #in~q; 110092#L20 assume !(~p <= 0); 110091#L21 assume ~q <= 0;#res := 0; 110090#partsFINAL assume true; 110073#partsEXIT >#66#return; 110076#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110439#partsFINAL assume true; 110079#partsEXIT >#64#return; 110075#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110077#$Ultimate##0 ~p := #in~p;~q := #in~q; 110092#L20 assume !(~p <= 0); 110091#L21 assume ~q <= 0;#res := 0; 110090#partsFINAL assume true; 110073#partsEXIT >#66#return; 110071#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110070#partsFINAL assume true; 110051#partsEXIT >#64#return; 110005#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110006#$Ultimate##0 ~p := #in~p;~q := #in~q; 110048#L20 assume !(~p <= 0); 110047#L21 assume ~q <= 0;#res := 0; 110044#partsFINAL assume true; 110004#partsEXIT >#66#return; 110000#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 109998#partsFINAL assume true; 109994#partsEXIT >#68#return; 109985#L36-1 havoc main_#t~ret8#1; 109991#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109989#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109984#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109987#$Ultimate##0 ~p := #in~p;~q := #in~q; 110035#L20 assume !(~p <= 0); 110034#L21 assume !(~q <= 0); 110030#L22 assume !(~q > ~p); 110032#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110046#$Ultimate##0 ~p := #in~p;~q := #in~q; 110050#L20 assume ~p <= 0;#res := 1; 110049#partsFINAL assume true; 110045#partsEXIT >#64#return; 110040#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110043#$Ultimate##0 ~p := #in~p;~q := #in~q; 110209#L20 assume !(~p <= 0); 110210#L21 assume !(~q <= 0); 110822#L22 assume !(~q > ~p); 110138#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110156#$Ultimate##0 ~p := #in~p;~q := #in~q; 110816#L20 assume !(~p <= 0); 110812#L21 assume !(~q <= 0); 110809#L22 assume !(~q > ~p); 110804#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110807#$Ultimate##0 ~p := #in~p;~q := #in~q; 110811#L20 assume ~p <= 0;#res := 1; 110808#partsFINAL assume true; 110803#partsEXIT >#64#return; 110741#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 109863#$Ultimate##0 ~p := #in~p;~q := #in~q; 110802#L20 assume !(~p <= 0); 110801#L21 assume ~q <= 0;#res := 0; 110800#partsFINAL assume true; 110740#partsEXIT >#66#return; 110726#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110725#partsFINAL assume true; 110136#partsEXIT >#64#return; 110116#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110119#$Ultimate##0 ~p := #in~p;~q := #in~q; 110143#L20 assume !(~p <= 0); 110135#L21 assume ~q <= 0;#res := 0; 110130#partsFINAL assume true; 110115#partsEXIT >#66#return; 110118#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110214#partsFINAL assume true; 110213#partsEXIT >#66#return; 110016#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110015#partsFINAL assume true; 109996#partsEXIT >#68#return; 109993#L36-1 havoc main_#t~ret8#1; 109992#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 109990#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 109962#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 109988#$Ultimate##0 ~p := #in~p;~q := #in~q; 110269#L20 assume !(~p <= 0); 110263#L21 assume !(~q <= 0); 110261#L22 assume ~q > ~p; 110253#L22-1 call #t~ret0 := parts(~p, ~p);< 110259#$Ultimate##0 ~p := #in~p;~q := #in~q; 110445#L20 assume !(~p <= 0); 110446#L21 assume !(~q <= 0); 110438#L22 assume !(~q > ~p); 110331#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110332#$Ultimate##0 ~p := #in~p;~q := #in~q; 110337#L20 assume ~p <= 0;#res := 1; 110335#partsFINAL assume true; 110329#partsEXIT >#64#return; 110266#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110319#$Ultimate##0 ~p := #in~p;~q := #in~q; 110314#L20 assume !(~p <= 0); 110310#L21 assume !(~q <= 0); 110306#L22 assume !(~q > ~p); 110292#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110297#$Ultimate##0 ~p := #in~p;~q := #in~q; 110628#L20 assume !(~p <= 0); 110591#L21 assume !(~q <= 0); 110554#L22 assume !(~q > ~p); 110610#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110612#$Ultimate##0 ~p := #in~p;~q := #in~q; 110624#L20 assume ~p <= 0;#res := 1; 110619#partsFINAL assume true; 110609#partsEXIT >#64#return; 110594#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110599#$Ultimate##0 ~p := #in~p;~q := #in~q; 110614#L20 assume !(~p <= 0); 110613#L21 assume ~q <= 0;#res := 0; 110600#partsFINAL assume true; 110593#partsEXIT >#66#return; 110598#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110635#partsFINAL assume true; 110291#partsEXIT >#64#return; 110279#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110287#$Ultimate##0 ~p := #in~p;~q := #in~q; 110302#L20 assume !(~p <= 0); 110296#L21 assume ~q <= 0;#res := 0; 110289#partsFINAL assume true; 110278#partsEXIT >#66#return; 110281#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110272#partsFINAL assume true; 110273#partsEXIT >#66#return; 110262#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110260#partsFINAL assume true; 110251#partsEXIT >#62#return; 110250#L22-2 #res := #t~ret0;havoc #t~ret0; 110249#partsFINAL assume true; 109961#partsEXIT >#68#return; 109924#L36-1 [2023-02-15 23:15:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 4 times [2023-02-15 23:15:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:04,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544188073] [2023-02-15 23:15:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:04,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:04,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash -237705661, now seen corresponding path program 3 times [2023-02-15 23:15:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:04,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105764288] [2023-02-15 23:15:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 23:15:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 23:15:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-15 23:15:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-02-15 23:15:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 151 proven. 392 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2023-02-15 23:15:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105764288] [2023-02-15 23:15:04,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105764288] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:04,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590400626] [2023-02-15 23:15:04,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:15:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:04,915 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:04,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2023-02-15 23:15:04,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-15 23:15:04,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:04,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 23:15:04,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 424 proven. 476 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2023-02-15 23:15:05,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 413 proven. 492 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-02-15 23:15:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590400626] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:06,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 23] total 50 [2023-02-15 23:15:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209078525] [2023-02-15 23:15:06,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:06,815 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:15:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 23:15:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2201, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 23:15:06,816 INFO L87 Difference]: Start difference. First operand 1063 states and 1331 transitions. cyclomatic complexity: 285 Second operand has 50 states, 45 states have (on average 2.933333333333333) internal successors, (132), 45 states have internal predecessors, (132), 36 states have call successors, (45), 1 states have call predecessors, (45), 13 states have return successors, (51), 26 states have call predecessors, (51), 36 states have call successors, (51) [2023-02-15 23:15:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:09,032 INFO L93 Difference]: Finished difference Result 1784 states and 2488 transitions. [2023-02-15 23:15:09,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1784 states and 2488 transitions. [2023-02-15 23:15:09,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2023-02-15 23:15:09,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1784 states to 1177 states and 1436 transitions. [2023-02-15 23:15:09,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2023-02-15 23:15:09,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2023-02-15 23:15:09,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1177 states and 1436 transitions. [2023-02-15 23:15:09,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:09,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1177 states and 1436 transitions. [2023-02-15 23:15:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states and 1436 transitions. [2023-02-15 23:15:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1038. [2023-02-15 23:15:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 734 states have (on average 1.0408719346049047) internal successors, (764), 752 states have internal predecessors, (764), 173 states have call successors, (187), 130 states have call predecessors, (187), 131 states have return successors, (276), 155 states have call predecessors, (276), 173 states have call successors, (276) [2023-02-15 23:15:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1227 transitions. [2023-02-15 23:15:09,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1038 states and 1227 transitions. [2023-02-15 23:15:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-15 23:15:09,058 INFO L428 stractBuchiCegarLoop]: Abstraction has 1038 states and 1227 transitions. [2023-02-15 23:15:09,058 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-02-15 23:15:09,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1038 states and 1227 transitions. [2023-02-15 23:15:09,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2023-02-15 23:15:09,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:09,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:09,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:09,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 16, 9, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:09,062 INFO L748 eck$LassoCheckResult]: Stem: 114482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 114441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 114442#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 114435#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 114436#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 114526#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114523#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114524#$Ultimate##0 ~p := #in~p;~q := #in~q; 114527#L20 assume ~p <= 0;#res := 1; 114525#partsFINAL assume true; 114522#partsEXIT >#68#return; 114520#L36-1 havoc main_#t~ret8#1; 114519#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114516#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114511#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114513#$Ultimate##0 ~p := #in~p;~q := #in~q; 114517#L20 assume ~p <= 0;#res := 1; 114514#partsFINAL assume true; 114510#partsEXIT >#68#return; 114509#L36-1 havoc main_#t~ret8#1; 114508#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114506#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114502#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114504#$Ultimate##0 ~p := #in~p;~q := #in~q; 114507#L20 assume ~p <= 0;#res := 1; 114505#partsFINAL assume true; 114501#partsEXIT >#68#return; 114500#L36-1 havoc main_#t~ret8#1; 114499#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114498#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 114453#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 114454#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 114497#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114641#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114642#$Ultimate##0 ~p := #in~p;~q := #in~q; 114652#L20 assume !(~p <= 0); 114650#L21 assume ~q <= 0;#res := 0; 114648#partsFINAL assume true; 114640#partsEXIT >#68#return; 114635#L36-1 havoc main_#t~ret8#1; 114631#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114629#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114626#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114627#$Ultimate##0 ~p := #in~p;~q := #in~q; 114651#L20 assume !(~p <= 0); 114649#L21 assume !(~q <= 0); 114647#L22 assume !(~q > ~p); 114638#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114639#$Ultimate##0 ~p := #in~p;~q := #in~q; 114646#L20 assume ~p <= 0;#res := 1; 114644#partsFINAL assume true; 114637#partsEXIT >#64#return; 114633#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114634#$Ultimate##0 ~p := #in~p;~q := #in~q; 114645#L20 assume !(~p <= 0); 114643#L21 assume ~q <= 0;#res := 0; 114636#partsFINAL assume true; 114632#partsEXIT >#66#return; 114630#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114628#partsFINAL assume true; 114625#partsEXIT >#68#return; 114624#L36-1 havoc main_#t~ret8#1; 114623#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114622#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114616#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114620#$Ultimate##0 ~p := #in~p;~q := #in~q; 114619#L20 assume !(~p <= 0); 114618#L21 assume !(~q <= 0); 114617#L22 assume ~q > ~p; 114605#L22-1 call #t~ret0 := parts(~p, ~p);< 114614#$Ultimate##0 ~p := #in~p;~q := #in~q; 114615#L20 assume !(~p <= 0); 114720#L21 assume !(~q <= 0); 114719#L22 assume !(~q > ~p); 114702#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114703#$Ultimate##0 ~p := #in~p;~q := #in~q; 114728#L20 assume ~p <= 0;#res := 1; 114726#partsFINAL assume true; 114709#partsEXIT >#64#return; 114687#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114693#$Ultimate##0 ~p := #in~p;~q := #in~q; 114741#L20 assume !(~p <= 0); 114714#L21 assume ~q <= 0;#res := 0; 114708#partsFINAL assume true; 114686#partsEXIT >#66#return; 114677#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114678#partsFINAL assume true; 114972#partsEXIT >#62#return; 114969#L22-2 #res := #t~ret0;havoc #t~ret0; 114659#partsFINAL assume true; 114660#partsEXIT >#68#return; 114961#L36-1 [2023-02-15 23:15:09,062 INFO L750 eck$LassoCheckResult]: Loop: 114961#L36-1 havoc main_#t~ret8#1; 114960#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114959#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 114958#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 114956#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 114954#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114951#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114952#$Ultimate##0 ~p := #in~p;~q := #in~q; 114957#L20 assume !(~p <= 0); 114955#L21 assume ~q <= 0;#res := 0; 114953#partsFINAL assume true; 114950#partsEXIT >#68#return; 114949#L36-1 havoc main_#t~ret8#1; 114948#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114947#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114943#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114945#$Ultimate##0 ~p := #in~p;~q := #in~q; 115070#L20 assume !(~p <= 0); 115069#L21 assume !(~q <= 0); 115067#L22 assume !(~q > ~p); 115064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115065#$Ultimate##0 ~p := #in~p;~q := #in~q; 115087#L20 assume !(~p <= 0); 115086#L21 assume !(~q <= 0); 115085#L22 assume !(~q > ~p); 115081#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115083#$Ultimate##0 ~p := #in~p;~q := #in~q; 115090#L20 assume ~p <= 0;#res := 1; 115088#partsFINAL assume true; 115080#partsEXIT >#64#return; 115076#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115078#$Ultimate##0 ~p := #in~p;~q := #in~q; 115224#L20 assume !(~p <= 0); 115223#L21 assume ~q <= 0;#res := 0; 115142#partsFINAL assume true; 115074#partsEXIT >#66#return; 115072#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115071#partsFINAL assume true; 115063#partsEXIT >#64#return; 115060#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115061#$Ultimate##0 ~p := #in~p;~q := #in~q; 115084#L20 assume !(~p <= 0); 115079#L21 assume ~q <= 0;#res := 0; 115073#partsFINAL assume true; 115059#partsEXIT >#66#return; 115055#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115053#partsFINAL assume true; 114942#partsEXIT >#68#return; 114940#L36-1 havoc main_#t~ret8#1; 114890#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114888#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114796#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114853#$Ultimate##0 ~p := #in~p;~q := #in~q; 114852#L20 assume !(~p <= 0); 114845#L21 assume !(~q <= 0); 114812#L22 assume !(~q > ~p); 114813#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114863#$Ultimate##0 ~p := #in~p;~q := #in~q; 115238#L20 assume ~p <= 0;#res := 1; 114837#partsFINAL assume true; 114838#partsEXIT >#64#return; 114790#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114855#$Ultimate##0 ~p := #in~p;~q := #in~q; 115405#L20 assume !(~p <= 0); 115403#L21 assume !(~q <= 0); 115314#L22 assume !(~q > ~p); 114882#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114984#$Ultimate##0 ~p := #in~p;~q := #in~q; 115310#L20 assume !(~p <= 0); 115308#L21 assume !(~q <= 0); 115309#L22 assume !(~q > ~p); 115342#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115344#$Ultimate##0 ~p := #in~p;~q := #in~q; 115355#L20 assume ~p <= 0;#res := 1; 115349#partsFINAL assume true; 115341#partsEXIT >#64#return; 115336#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115337#$Ultimate##0 ~p := #in~p;~q := #in~q; 115347#L20 assume !(~p <= 0); 115346#L21 assume ~q <= 0;#res := 0; 115340#partsFINAL assume true; 115334#partsEXIT >#66#return; 115269#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115270#partsFINAL assume true; 114880#partsEXIT >#64#return; 114875#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114878#$Ultimate##0 ~p := #in~p;~q := #in~q; 115241#L20 assume !(~p <= 0); 115240#L21 assume ~q <= 0;#res := 0; 114979#partsFINAL assume true; 114874#partsEXIT >#66#return; 114872#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114870#partsFINAL assume true; 114868#partsEXIT >#66#return; 114850#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114980#partsFINAL assume true; 114879#partsEXIT >#68#return; 114873#L36-1 havoc main_#t~ret8#1; 114871#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114869#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 114537#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 114856#$Ultimate##0 ~p := #in~p;~q := #in~q; 115151#L20 assume !(~p <= 0); 115149#L21 assume !(~q <= 0); 114974#L22 assume ~q > ~p; 114667#L22-1 call #t~ret0 := parts(~p, ~p);< 114672#$Ultimate##0 ~p := #in~p;~q := #in~q; 114749#L20 assume !(~p <= 0); 114745#L21 assume !(~q <= 0); 114743#L22 assume !(~q > ~p); 114716#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114713#$Ultimate##0 ~p := #in~p;~q := #in~q; 114747#L20 assume ~p <= 0;#res := 1; 114742#partsFINAL assume true; 114715#partsEXIT >#64#return; 114690#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114694#$Ultimate##0 ~p := #in~p;~q := #in~q; 115108#L20 assume !(~p <= 0); 115107#L21 assume !(~q <= 0); 115101#L22 assume !(~q > ~p); 114444#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114934#$Ultimate##0 ~p := #in~p;~q := #in~q; 115415#L20 assume !(~p <= 0); 114588#L21 assume !(~q <= 0); 114590#L22 assume !(~q > ~p); 114443#L23 call #t~ret1 := parts(~p - ~q, ~q);< 114448#$Ultimate##0 ~p := #in~p;~q := #in~q; 115189#L20 assume ~p <= 0;#res := 1; 115188#partsFINAL assume true; 115165#partsEXIT >#64#return; 115158#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115161#$Ultimate##0 ~p := #in~p;~q := #in~q; 115222#L20 assume !(~p <= 0); 115221#L21 assume ~q <= 0;#res := 0; 115192#partsFINAL assume true; 115157#partsEXIT >#66#return; 115160#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115231#partsFINAL assume true; 114929#partsEXIT >#64#return; 114820#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 114823#$Ultimate##0 ~p := #in~p;~q := #in~q; 115407#L20 assume !(~p <= 0); 114927#L21 assume ~q <= 0;#res := 0; 114924#partsFINAL assume true; 114819#partsEXIT >#66#return; 114803#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114786#partsFINAL assume true; 114688#partsEXIT >#66#return; 114691#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 114674#partsFINAL assume true; 114665#partsEXIT >#62#return; 114671#L22-2 #res := #t~ret0;havoc #t~ret0; 114966#partsFINAL assume true; 114963#partsEXIT >#68#return; 114961#L36-1 [2023-02-15 23:15:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 5 times [2023-02-15 23:15:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911000476] [2023-02-15 23:15:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:09,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:09,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:09,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -917288381, now seen corresponding path program 4 times [2023-02-15 23:15:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575629770] [2023-02-15 23:15:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:09,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:09,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 8683649, now seen corresponding path program 6 times [2023-02-15 23:15:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:09,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425485377] [2023-02-15 23:15:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 23:15:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 23:15:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 23:15:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-02-15 23:15:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-02-15 23:15:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-02-15 23:15:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-02-15 23:15:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 26 proven. 144 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2023-02-15 23:15:09,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425485377] [2023-02-15 23:15:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425485377] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289383922] [2023-02-15 23:15:09,346 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:15:09,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:09,389 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:09,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2023-02-15 23:15:09,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-02-15 23:15:09,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:09,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 23:15:09,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1149 proven. 151 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2023-02-15 23:15:09,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 186 proven. 220 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2023-02-15 23:15:10,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289383922] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:10,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:10,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 34 [2023-02-15 23:15:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531173150] [2023-02-15 23:15:10,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:11,307 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:11,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:11,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:11,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:11,308 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:15:11,308 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,308 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:11,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:11,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration21_Loop [2023-02-15 23:15:11,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:11,308 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:11,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,314 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,321 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:11,362 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:15:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:11,364 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-02-15 23:15:11,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:11,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:11,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:11,376 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2023-02-15 23:15:11,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:15:11,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:11,581 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:15:11,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:11,585 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:11,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:11,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:11,585 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:11,585 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:15:11,585 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,585 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:11,585 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:11,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration21_Loop [2023-02-15 23:15:11,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:11,585 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:11,586 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,594 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,596 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,597 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:11,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:11,632 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:15:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:11,633 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:11,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-02-15 23:15:11,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:11,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:11,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:11,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:11,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:11,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:11,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:11,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:11,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:11,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:11,646 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:15:11,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:11,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:11,648 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:11,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-02-15 23:15:11,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:11,650 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:11,650 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:11,650 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 3 Supporting invariants [] [2023-02-15 23:15:11,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:11,653 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:11,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 23:15:11,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:11,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:12,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 23:15:12,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 27 proven. 247 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2023-02-15 23:15:12,462 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-15 23:15:12,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1038 states and 1227 transitions. cyclomatic complexity: 205 Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-15 23:15:12,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1038 states and 1227 transitions. cyclomatic complexity: 205. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Result 2238 states and 2693 transitions. Complement of second has 81 states. [2023-02-15 23:15:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-15 23:15:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2023-02-15 23:15:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 154 letters. [2023-02-15 23:15:12,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:12,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 245 letters. Loop has 154 letters. [2023-02-15 23:15:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:12,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 308 letters. [2023-02-15 23:15:12,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:12,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2238 states and 2693 transitions. [2023-02-15 23:15:12,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:12,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2238 states to 1688 states and 1988 transitions. [2023-02-15 23:15:12,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 313 [2023-02-15 23:15:12,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 313 [2023-02-15 23:15:12,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1988 transitions. [2023-02-15 23:15:12,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:12,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1688 states and 1988 transitions. [2023-02-15 23:15:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1988 transitions. [2023-02-15 23:15:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1651. [2023-02-15 23:15:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1169 states have (on average 1.0419161676646707) internal successors, (1218), 1196 states have internal predecessors, (1218), 277 states have call successors, (301), 213 states have call predecessors, (301), 205 states have return successors, (411), 241 states have call predecessors, (411), 277 states have call successors, (411) [2023-02-15 23:15:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1930 transitions. [2023-02-15 23:15:12,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1651 states and 1930 transitions. [2023-02-15 23:15:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 23:15:12,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 23:15:12,792 INFO L87 Difference]: Start difference. First operand 1651 states and 1930 transitions. Second operand has 34 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 34 states have internal predecessors, (115), 22 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2023-02-15 23:15:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:13,278 INFO L93 Difference]: Finished difference Result 1987 states and 2373 transitions. [2023-02-15 23:15:13,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1987 states and 2373 transitions. [2023-02-15 23:15:13,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-15 23:15:13,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1987 states to 1625 states and 1941 transitions. [2023-02-15 23:15:13,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2023-02-15 23:15:13,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2023-02-15 23:15:13,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1625 states and 1941 transitions. [2023-02-15 23:15:13,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:13,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1625 states and 1941 transitions. [2023-02-15 23:15:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states and 1941 transitions. [2023-02-15 23:15:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1489. [2023-02-15 23:15:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1048 states have (on average 1.041030534351145) internal successors, (1091), 1072 states have internal predecessors, (1091), 255 states have call successors, (275), 185 states have call predecessors, (275), 186 states have return successors, (364), 231 states have call predecessors, (364), 255 states have call successors, (364) [2023-02-15 23:15:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1730 transitions. [2023-02-15 23:15:13,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1489 states and 1730 transitions. [2023-02-15 23:15:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 23:15:13,308 INFO L428 stractBuchiCegarLoop]: Abstraction has 1489 states and 1730 transitions. [2023-02-15 23:15:13,308 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-02-15 23:15:13,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1489 states and 1730 transitions. [2023-02-15 23:15:13,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:13,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:13,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:13,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 23, 15, 9, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:13,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [67, 67, 56, 35, 26, 26, 26, 26, 26, 26, 21, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 1, 1, 1] [2023-02-15 23:15:13,313 INFO L748 eck$LassoCheckResult]: Stem: 124225#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 124183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 124184#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 124177#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 124178#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 124239#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124904#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124905#$Ultimate##0 ~p := #in~p;~q := #in~q; 124907#L20 assume ~p <= 0;#res := 1; 124906#partsFINAL assume true; 124903#partsEXIT >#68#return; 124901#L36-1 havoc main_#t~ret8#1; 124900#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124898#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124895#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124896#$Ultimate##0 ~p := #in~p;~q := #in~q; 124899#L20 assume ~p <= 0;#res := 1; 124897#partsFINAL assume true; 124894#partsEXIT >#68#return; 124893#L36-1 havoc main_#t~ret8#1; 124892#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124890#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124888#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124858#$Ultimate##0 ~p := #in~p;~q := #in~q; 124891#L20 assume ~p <= 0;#res := 1; 124889#partsFINAL assume true; 124887#partsEXIT >#68#return; 124885#L36-1 havoc main_#t~ret8#1; 124863#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124862#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124210#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124209#$Ultimate##0 ~p := #in~p;~q := #in~q; 124211#L20 assume ~p <= 0;#res := 1; 124860#partsFINAL assume true; 124857#partsEXIT >#68#return; 124854#L36-1 havoc main_#t~ret8#1; 124843#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124731#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 124732#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 124715#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 124716#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124700#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124701#$Ultimate##0 ~p := #in~p;~q := #in~q; 124871#L20 assume !(~p <= 0); 124870#L21 assume ~q <= 0;#res := 0; 124868#partsFINAL assume true; 124699#partsEXIT >#68#return; 124695#L36-1 havoc main_#t~ret8#1; 124696#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124689#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124690#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124836#$Ultimate##0 ~p := #in~p;~q := #in~q; 124815#L20 assume !(~p <= 0); 124816#L21 assume !(~q <= 0); 124783#L22 assume !(~q > ~p); 124711#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124823#$Ultimate##0 ~p := #in~p;~q := #in~q; 124818#L20 assume ~p <= 0;#res := 1; 124819#partsFINAL assume true; 124710#partsEXIT >#64#return; 124712#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124848#$Ultimate##0 ~p := #in~p;~q := #in~q; 124853#L20 assume !(~p <= 0); 124852#L21 assume ~q <= 0;#res := 0; 124849#partsFINAL assume true; 124847#partsEXIT >#66#return; 124846#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124693#partsFINAL assume true; 124694#partsEXIT >#68#return; 124681#L36-1 havoc main_#t~ret8#1; 124683#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124676#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124657#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125148#$Ultimate##0 ~p := #in~p;~q := #in~q; 124660#L20 assume !(~p <= 0); 124661#L21 assume !(~q <= 0); 124656#L22 assume ~q > ~p; 124391#L22-1 call #t~ret0 := parts(~p, ~p);< 125150#$Ultimate##0 ~p := #in~p;~q := #in~q; 124927#L20 assume !(~p <= 0); 124928#L21 assume !(~q <= 0); 124924#L22 assume !(~q > ~p); 124919#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125183#$Ultimate##0 ~p := #in~p;~q := #in~q; 125186#L20 assume ~p <= 0;#res := 1; 125185#partsFINAL assume true; 125181#partsEXIT >#64#return; 125178#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125179#$Ultimate##0 ~p := #in~p;~q := #in~q; 125194#L20 assume !(~p <= 0); 125193#L21 assume ~q <= 0;#res := 0; 125192#partsFINAL assume true; 125177#partsEXIT >#66#return; 125175#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125174#partsFINAL assume true; 125172#partsEXIT >#62#return; 125171#L22-2 #res := #t~ret0;havoc #t~ret0; 125170#partsFINAL assume true; 125169#partsEXIT >#68#return; 124908#L36-1 havoc main_#t~ret8#1; 124814#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124804#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124769#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124780#$Ultimate##0 ~p := #in~p;~q := #in~q; 124778#L20 assume !(~p <= 0); 124774#L21 assume !(~q <= 0); 124770#L22 assume ~q > ~p; 124281#L22-1 call #t~ret0 := parts(~p, ~p);< 124768#$Ultimate##0 ~p := #in~p;~q := #in~q; 124280#L20 assume !(~p <= 0); 124282#L21 assume !(~q <= 0); 124333#L22 assume !(~q > ~p); 124237#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124305#$Ultimate##0 ~p := #in~p;~q := #in~q; 124309#L20 assume ~p <= 0;#res := 1; 124307#partsFINAL assume true; 124295#partsEXIT >#64#return; 124297#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124478#$Ultimate##0 ~p := #in~p;~q := #in~q; 124499#L20 assume !(~p <= 0); 124498#L21 assume !(~q <= 0); 124497#L22 assume !(~q > ~p); 124268#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124277#$Ultimate##0 ~p := #in~p;~q := #in~q; 124278#L20 assume !(~p <= 0); 124266#L21 assume !(~q <= 0); 124271#L22 assume !(~q > ~p); 124275#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124279#$Ultimate##0 ~p := #in~p;~q := #in~q; 124273#L20 assume !(~p <= 0); 124276#L21 assume !(~q <= 0); 124508#L22 assume ~q > ~p; 124186#L22-1 call #t~ret0 := parts(~p, ~p);< 124283#$Ultimate##0 ~p := #in~p;~q := #in~q; 124284#L20 assume !(~p <= 0); 124272#L21 assume !(~q <= 0); 124263#L22 assume !(~q > ~p); 124185#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124188#$Ultimate##0 ~p := #in~p;~q := #in~q; 124582#L20 assume ~p <= 0;#res := 1; 124581#partsFINAL assume true; 124580#partsEXIT >#64#return; 124572#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124573#$Ultimate##0 ~p := #in~p;~q := #in~q; 124576#L20 assume !(~p <= 0); 124575#L21 assume ~q <= 0;#res := 0; 124574#partsFINAL assume true; 124571#partsEXIT >#66#return; 124570#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124569#partsFINAL assume true; 124562#partsEXIT >#62#return; 124556#L22-2 #res := #t~ret0;havoc #t~ret0; 124553#partsFINAL assume true; 124507#partsEXIT >#64#return; 124503#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124505#$Ultimate##0 ~p := #in~p;~q := #in~q; 124518#L20 assume !(~p <= 0); 124516#L21 assume ~q <= 0;#res := 0; 124514#partsFINAL assume true; 124501#partsEXIT >#66#return; 124496#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124495#partsFINAL assume true; 124490#partsEXIT >#64#return; 124487#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124489#$Ultimate##0 ~p := #in~p;~q := #in~q; 124506#L20 assume !(~p <= 0); 124494#L21 assume ~q <= 0;#res := 0; 124492#partsFINAL assume true; 124486#partsEXIT >#66#return; 124483#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124481#partsFINAL assume true; 124476#partsEXIT >#66#return; 124474#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124472#partsFINAL assume true; 124468#partsEXIT >#62#return; 124470#L22-2 #res := #t~ret0;havoc #t~ret0; 124883#partsFINAL assume true; 124884#partsEXIT >#68#return; 124260#L36-1 [2023-02-15 23:15:13,314 INFO L750 eck$LassoCheckResult]: Loop: 124260#L36-1 havoc main_#t~ret8#1; 125083#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124241#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 124192#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 124193#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 124201#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124202#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124257#$Ultimate##0 ~p := #in~p;~q := #in~q; 124256#L20 assume !(~p <= 0); 124255#L21 assume ~q <= 0;#res := 0; 124253#partsFINAL assume true; 124254#partsEXIT >#68#return; 125024#L36-1 havoc main_#t~ret8#1; 125023#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125022#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124179#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124180#$Ultimate##0 ~p := #in~p;~q := #in~q; 125092#L20 assume !(~p <= 0); 125087#L21 assume !(~q <= 0); 125085#L22 assume !(~q > ~p); 125031#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125033#$Ultimate##0 ~p := #in~p;~q := #in~q; 125070#L20 assume !(~p <= 0); 125069#L21 assume !(~q <= 0); 125068#L22 assume !(~q > ~p); 125052#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125053#$Ultimate##0 ~p := #in~p;~q := #in~q; 125061#L20 assume !(~p <= 0); 125060#L21 assume !(~q <= 0); 125058#L22 assume !(~q > ~p); 125050#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125053#$Ultimate##0 ~p := #in~p;~q := #in~q; 125061#L20 assume !(~p <= 0); 125060#L21 assume !(~q <= 0); 125058#L22 assume !(~q > ~p); 125059#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125067#$Ultimate##0 ~p := #in~p;~q := #in~q; 125072#L20 assume ~p <= 0;#res := 1; 125071#partsFINAL assume true; 125066#partsEXIT >#64#return; 125064#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125065#$Ultimate##0 ~p := #in~p;~q := #in~q; 125076#L20 assume !(~p <= 0); 125075#L21 assume ~q <= 0;#res := 0; 125073#partsFINAL assume true; 125063#partsEXIT >#66#return; 125062#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125056#partsFINAL assume true; 125049#partsEXIT >#64#return; 125046#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125048#$Ultimate##0 ~p := #in~p;~q := #in~q; 125078#L20 assume !(~p <= 0); 125077#L21 assume ~q <= 0;#res := 0; 125074#partsFINAL assume true; 125044#partsEXIT >#66#return; 125047#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125096#partsFINAL assume true; 125094#partsEXIT >#64#return; 125090#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125091#$Ultimate##0 ~p := #in~p;~q := #in~q; 125097#L20 assume !(~p <= 0); 125095#L21 assume ~q <= 0;#res := 0; 125093#partsFINAL assume true; 125088#partsEXIT >#66#return; 125086#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125084#partsFINAL assume true; 125030#partsEXIT >#64#return; 125027#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125029#$Ultimate##0 ~p := #in~p;~q := #in~q; 125082#L20 assume !(~p <= 0); 125081#L21 assume ~q <= 0;#res := 0; 125079#partsFINAL assume true; 125026#partsEXIT >#66#return; 125025#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125020#partsFINAL assume true; 125017#partsEXIT >#68#return; 125016#L36-1 havoc main_#t~ret8#1; 125015#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125014#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124378#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124372#$Ultimate##0 ~p := #in~p;~q := #in~q; 124423#L20 assume !(~p <= 0); 124417#L21 assume !(~q <= 0); 124414#L22 assume !(~q > ~p); 124415#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124930#$Ultimate##0 ~p := #in~p;~q := #in~q; 124943#L20 assume !(~p <= 0); 124939#L21 assume !(~q <= 0); 124937#L22 assume ~q > ~p; 124934#L22-1 call #t~ret0 := parts(~p, ~p);< 124935#$Ultimate##0 ~p := #in~p;~q := #in~q; 124954#L20 assume !(~p <= 0); 124953#L21 assume !(~q <= 0); 124950#L22 assume !(~q > ~p); 124946#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124947#$Ultimate##0 ~p := #in~p;~q := #in~q; 124952#L20 assume ~p <= 0;#res := 1; 124949#partsFINAL assume true; 124945#partsEXIT >#64#return; 124941#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124942#$Ultimate##0 ~p := #in~p;~q := #in~q; 124951#L20 assume !(~p <= 0); 124948#L21 assume ~q <= 0;#res := 0; 124944#partsFINAL assume true; 124940#partsEXIT >#66#return; 124938#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124936#partsFINAL assume true; 124933#partsEXIT >#62#return; 124932#L22-2 #res := #t~ret0;havoc #t~ret0; 124931#partsFINAL assume true; 124929#partsEXIT >#64#return; 124437#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124448#$Ultimate##0 ~p := #in~p;~q := #in~q; 124855#L20 assume !(~p <= 0); 124850#L21 assume !(~q <= 0); 124844#L22 assume !(~q > ~p); 124461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124463#$Ultimate##0 ~p := #in~p;~q := #in~q; 124550#L20 assume !(~p <= 0); 124548#L21 assume !(~q <= 0); 124547#L22 assume !(~q > ~p); 124534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124541#$Ultimate##0 ~p := #in~p;~q := #in~q; 124546#L20 assume !(~p <= 0); 124544#L21 assume !(~q <= 0); 124545#L22 assume ~q > ~p; 124593#L22-1 call #t~ret0 := parts(~p, ~p);< 124595#$Ultimate##0 ~p := #in~p;~q := #in~q; 124642#L20 assume !(~p <= 0); 124639#L21 assume !(~q <= 0); 124628#L22 assume !(~q > ~p); 124622#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124623#$Ultimate##0 ~p := #in~p;~q := #in~q; 124630#L20 assume ~p <= 0;#res := 1; 124627#partsFINAL assume true; 124621#partsEXIT >#64#return; 124605#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124606#$Ultimate##0 ~p := #in~p;~q := #in~q; 124618#L20 assume !(~p <= 0); 124617#L21 assume ~q <= 0;#res := 0; 124616#partsFINAL assume true; 124604#partsEXIT >#66#return; 124602#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124601#partsFINAL assume true; 124591#partsEXIT >#62#return; 124584#L22-2 #res := #t~ret0;havoc #t~ret0; 124585#partsFINAL assume true; 124536#partsEXIT >#64#return; 124530#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124532#$Ultimate##0 ~p := #in~p;~q := #in~q; 124542#L20 assume !(~p <= 0); 124540#L21 assume ~q <= 0;#res := 0; 124533#partsFINAL assume true; 124528#partsEXIT >#66#return; 124527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124526#partsFINAL assume true; 124522#partsEXIT >#64#return; 124451#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124456#$Ultimate##0 ~p := #in~p;~q := #in~q; 124466#L20 assume !(~p <= 0); 124464#L21 assume ~q <= 0;#res := 0; 124457#partsFINAL assume true; 124450#partsEXIT >#66#return; 124444#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124449#partsFINAL assume true; 124434#partsEXIT >#66#return; 124446#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125013#partsFINAL assume true; 125012#partsEXIT >#68#return; 124959#L36-1 havoc main_#t~ret8#1; 124955#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124916#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124379#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124372#$Ultimate##0 ~p := #in~p;~q := #in~q; 124423#L20 assume !(~p <= 0); 124417#L21 assume !(~q <= 0); 124414#L22 assume !(~q > ~p); 124415#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124930#$Ultimate##0 ~p := #in~p;~q := #in~q; 124943#L20 assume !(~p <= 0); 124939#L21 assume !(~q <= 0); 124937#L22 assume ~q > ~p; 124934#L22-1 call #t~ret0 := parts(~p, ~p);< 124935#$Ultimate##0 ~p := #in~p;~q := #in~q; 124954#L20 assume !(~p <= 0); 124953#L21 assume !(~q <= 0); 124950#L22 assume !(~q > ~p); 124946#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124947#$Ultimate##0 ~p := #in~p;~q := #in~q; 124952#L20 assume ~p <= 0;#res := 1; 124949#partsFINAL assume true; 124945#partsEXIT >#64#return; 124941#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124942#$Ultimate##0 ~p := #in~p;~q := #in~q; 124951#L20 assume !(~p <= 0); 124948#L21 assume ~q <= 0;#res := 0; 124944#partsFINAL assume true; 124940#partsEXIT >#66#return; 124938#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124936#partsFINAL assume true; 124933#partsEXIT >#62#return; 124932#L22-2 #res := #t~ret0;havoc #t~ret0; 124931#partsFINAL assume true; 124929#partsEXIT >#64#return; 124437#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124448#$Ultimate##0 ~p := #in~p;~q := #in~q; 124855#L20 assume !(~p <= 0); 124850#L21 assume !(~q <= 0); 124844#L22 assume !(~q > ~p); 124461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124463#$Ultimate##0 ~p := #in~p;~q := #in~q; 124550#L20 assume !(~p <= 0); 124548#L21 assume !(~q <= 0); 124547#L22 assume !(~q > ~p); 124534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124541#$Ultimate##0 ~p := #in~p;~q := #in~q; 124546#L20 assume !(~p <= 0); 124544#L21 assume !(~q <= 0); 124545#L22 assume ~q > ~p; 124593#L22-1 call #t~ret0 := parts(~p, ~p);< 124595#$Ultimate##0 ~p := #in~p;~q := #in~q; 124642#L20 assume !(~p <= 0); 124639#L21 assume !(~q <= 0); 124628#L22 assume !(~q > ~p); 124622#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124623#$Ultimate##0 ~p := #in~p;~q := #in~q; 124630#L20 assume ~p <= 0;#res := 1; 124627#partsFINAL assume true; 124621#partsEXIT >#64#return; 124605#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124606#$Ultimate##0 ~p := #in~p;~q := #in~q; 124618#L20 assume !(~p <= 0); 124617#L21 assume ~q <= 0;#res := 0; 124616#partsFINAL assume true; 124604#partsEXIT >#66#return; 124602#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124601#partsFINAL assume true; 124591#partsEXIT >#62#return; 124584#L22-2 #res := #t~ret0;havoc #t~ret0; 124585#partsFINAL assume true; 124536#partsEXIT >#64#return; 124530#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124532#$Ultimate##0 ~p := #in~p;~q := #in~q; 124542#L20 assume !(~p <= 0); 124540#L21 assume ~q <= 0;#res := 0; 124533#partsFINAL assume true; 124528#partsEXIT >#66#return; 124527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124526#partsFINAL assume true; 124522#partsEXIT >#64#return; 124451#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124456#$Ultimate##0 ~p := #in~p;~q := #in~q; 124466#L20 assume !(~p <= 0); 124464#L21 assume ~q <= 0;#res := 0; 124457#partsFINAL assume true; 124450#partsEXIT >#66#return; 124444#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124449#partsFINAL assume true; 124434#partsEXIT >#66#return; 124446#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125013#partsFINAL assume true; 125012#partsEXIT >#68#return; 124886#L36-1 havoc main_#t~ret8#1; 124655#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124653#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124380#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124372#$Ultimate##0 ~p := #in~p;~q := #in~q; 124423#L20 assume !(~p <= 0); 124417#L21 assume !(~q <= 0); 124414#L22 assume !(~q > ~p); 124409#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124411#$Ultimate##0 ~p := #in~p;~q := #in~q; 124429#L20 assume ~p <= 0;#res := 1; 124425#partsFINAL assume true; 124408#partsEXIT >#64#return; 124386#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124389#$Ultimate##0 ~p := #in~p;~q := #in~q; 124745#L20 assume !(~p <= 0); 124743#L21 assume !(~q <= 0); 124733#L22 assume !(~q > ~p); 124728#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124729#$Ultimate##0 ~p := #in~p;~q := #in~q; 124763#L20 assume !(~p <= 0); 124759#L21 assume !(~q <= 0); 124757#L22 assume ~q > ~p; 124750#L22-1 call #t~ret0 := parts(~p, ~p);< 124751#$Ultimate##0 ~p := #in~p;~q := #in~q; 124779#L20 assume !(~p <= 0); 124777#L21 assume !(~q <= 0); 124773#L22 assume !(~q > ~p); 124766#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124767#$Ultimate##0 ~p := #in~p;~q := #in~q; 124776#L20 assume ~p <= 0;#res := 1; 124772#partsFINAL assume true; 124765#partsEXIT >#64#return; 124761#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124762#$Ultimate##0 ~p := #in~p;~q := #in~q; 124775#L20 assume !(~p <= 0); 124771#L21 assume ~q <= 0;#res := 0; 124764#partsFINAL assume true; 124760#partsEXIT >#66#return; 124758#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124756#partsFINAL assume true; 124749#partsEXIT >#62#return; 124747#L22-2 #res := #t~ret0;havoc #t~ret0; 124737#partsFINAL assume true; 124723#partsEXIT >#64#return; 124439#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124448#$Ultimate##0 ~p := #in~p;~q := #in~q; 124855#L20 assume !(~p <= 0); 124850#L21 assume !(~q <= 0); 124844#L22 assume !(~q > ~p); 124461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124463#$Ultimate##0 ~p := #in~p;~q := #in~q; 124550#L20 assume !(~p <= 0); 124548#L21 assume !(~q <= 0); 124547#L22 assume !(~q > ~p); 124534#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124541#$Ultimate##0 ~p := #in~p;~q := #in~q; 124546#L20 assume !(~p <= 0); 124544#L21 assume !(~q <= 0); 124545#L22 assume ~q > ~p; 124593#L22-1 call #t~ret0 := parts(~p, ~p);< 124595#$Ultimate##0 ~p := #in~p;~q := #in~q; 124642#L20 assume !(~p <= 0); 124639#L21 assume !(~q <= 0); 124628#L22 assume !(~q > ~p); 124622#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124623#$Ultimate##0 ~p := #in~p;~q := #in~q; 124630#L20 assume ~p <= 0;#res := 1; 124627#partsFINAL assume true; 124621#partsEXIT >#64#return; 124605#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124606#$Ultimate##0 ~p := #in~p;~q := #in~q; 124618#L20 assume !(~p <= 0); 124617#L21 assume ~q <= 0;#res := 0; 124616#partsFINAL assume true; 124604#partsEXIT >#66#return; 124602#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124601#partsFINAL assume true; 124591#partsEXIT >#62#return; 124584#L22-2 #res := #t~ret0;havoc #t~ret0; 124585#partsFINAL assume true; 124536#partsEXIT >#64#return; 124530#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124532#$Ultimate##0 ~p := #in~p;~q := #in~q; 124542#L20 assume !(~p <= 0); 124540#L21 assume ~q <= 0;#res := 0; 124533#partsFINAL assume true; 124528#partsEXIT >#66#return; 124527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124526#partsFINAL assume true; 124522#partsEXIT >#64#return; 124451#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124456#$Ultimate##0 ~p := #in~p;~q := #in~q; 124466#L20 assume !(~p <= 0); 124464#L21 assume ~q <= 0;#res := 0; 124457#partsFINAL assume true; 124450#partsEXIT >#66#return; 124444#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124449#partsFINAL assume true; 124434#partsEXIT >#66#return; 124424#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124405#partsFINAL assume true; 124384#partsEXIT >#66#return; 124382#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124381#partsFINAL assume true; 124377#partsEXIT >#68#return; 124376#L36-1 havoc main_#t~ret8#1; 124375#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 124374#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 124259#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 124373#$Ultimate##0 ~p := #in~p;~q := #in~q; 124479#L20 assume !(~p <= 0); 124475#L21 assume !(~q <= 0); 124473#L22 assume ~q > ~p; 124337#L22-1 call #t~ret0 := parts(~p, ~p);< 124342#$Ultimate##0 ~p := #in~p;~q := #in~q; 124336#L20 assume !(~p <= 0); 124340#L21 assume !(~q <= 0); 124353#L22 assume !(~q > ~p); 124350#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124351#$Ultimate##0 ~p := #in~p;~q := #in~q; 124354#L20 assume ~p <= 0;#res := 1; 124352#partsFINAL assume true; 124349#partsEXIT >#64#return; 124345#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124348#$Ultimate##0 ~p := #in~p;~q := #in~q; 124347#L20 assume !(~p <= 0); 124346#L21 assume !(~q <= 0); 124344#L22 assume !(~q > ~p); 124301#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124306#$Ultimate##0 ~p := #in~p;~q := #in~q; 124321#L20 assume !(~p <= 0); 124317#L21 assume !(~q <= 0); 124315#L22 assume ~q > ~p; 124312#L22-1 call #t~ret0 := parts(~p, ~p);< 124313#$Ultimate##0 ~p := #in~p;~q := #in~q; 124332#L20 assume !(~p <= 0); 124331#L21 assume !(~q <= 0); 124328#L22 assume !(~q > ~p); 124324#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124325#$Ultimate##0 ~p := #in~p;~q := #in~q; 124330#L20 assume ~p <= 0;#res := 1; 124327#partsFINAL assume true; 124323#partsEXIT >#64#return; 124319#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124320#$Ultimate##0 ~p := #in~p;~q := #in~q; 124329#L20 assume !(~p <= 0); 124326#L21 assume ~q <= 0;#res := 0; 124322#partsFINAL assume true; 124318#partsEXIT >#66#return; 124316#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124314#partsFINAL assume true; 124311#partsEXIT >#62#return; 124310#L22-2 #res := #t~ret0;havoc #t~ret0; 124308#partsFINAL assume true; 124298#partsEXIT >#64#return; 124287#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124292#$Ultimate##0 ~p := #in~p;~q := #in~q; 124293#L20 assume !(~p <= 0); 124286#L21 assume !(~q <= 0); 124289#L22 assume !(~q > ~p); 124269#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124277#$Ultimate##0 ~p := #in~p;~q := #in~q; 124278#L20 assume !(~p <= 0); 124266#L21 assume !(~q <= 0); 124271#L22 assume !(~q > ~p); 124275#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124279#$Ultimate##0 ~p := #in~p;~q := #in~q; 124273#L20 assume !(~p <= 0); 124276#L21 assume !(~q <= 0); 124508#L22 assume ~q > ~p; 124186#L22-1 call #t~ret0 := parts(~p, ~p);< 124283#$Ultimate##0 ~p := #in~p;~q := #in~q; 124284#L20 assume !(~p <= 0); 124272#L21 assume !(~q <= 0); 124263#L22 assume !(~q > ~p); 124185#L23 call #t~ret1 := parts(~p - ~q, ~q);< 124188#$Ultimate##0 ~p := #in~p;~q := #in~q; 124582#L20 assume ~p <= 0;#res := 1; 124581#partsFINAL assume true; 124580#partsEXIT >#64#return; 124572#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124573#$Ultimate##0 ~p := #in~p;~q := #in~q; 124576#L20 assume !(~p <= 0); 124575#L21 assume ~q <= 0;#res := 0; 124574#partsFINAL assume true; 124571#partsEXIT >#66#return; 124570#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124569#partsFINAL assume true; 124562#partsEXIT >#62#return; 124556#L22-2 #res := #t~ret0;havoc #t~ret0; 124553#partsFINAL assume true; 124507#partsEXIT >#64#return; 124503#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124505#$Ultimate##0 ~p := #in~p;~q := #in~q; 124518#L20 assume !(~p <= 0); 124516#L21 assume ~q <= 0;#res := 0; 124514#partsFINAL assume true; 124501#partsEXIT >#66#return; 124496#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124495#partsFINAL assume true; 124490#partsEXIT >#64#return; 124488#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 124489#$Ultimate##0 ~p := #in~p;~q := #in~q; 124506#L20 assume !(~p <= 0); 124494#L21 assume ~q <= 0;#res := 0; 124492#partsFINAL assume true; 124486#partsEXIT >#66#return; 124485#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124491#partsFINAL assume true; 124484#partsEXIT >#66#return; 124482#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124480#partsFINAL assume true; 124477#partsEXIT >#66#return; 124474#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 124472#partsFINAL assume true; 124468#partsEXIT >#62#return; 124467#L22-2 #res := #t~ret0;havoc #t~ret0; 124465#partsFINAL assume true; 124258#partsEXIT >#68#return; 124260#L36-1 [2023-02-15 23:15:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -267250891, now seen corresponding path program 7 times [2023-02-15 23:15:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668883994] [2023-02-15 23:15:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:15:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 23:15:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-15 23:15:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-15 23:15:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 23:15:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-02-15 23:15:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 343 proven. 176 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2023-02-15 23:15:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668883994] [2023-02-15 23:15:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668883994] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432686237] [2023-02-15 23:15:13,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:15:13,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:13,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:13,693 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:13,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2023-02-15 23:15:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:13,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 23:15:13,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 208 proven. 131 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2023-02-15 23:15:13,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 208 proven. 133 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2023-02-15 23:15:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432686237] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:14,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 9] total 22 [2023-02-15 23:15:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997065966] [2023-02-15 23:15:14,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:14,216 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:15:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1570356883, now seen corresponding path program 5 times [2023-02-15 23:15:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938375335] [2023-02-15 23:15:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 23:15:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 23:15:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-15 23:15:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-02-15 23:15:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-02-15 23:15:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-02-15 23:15:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-02-15 23:15:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-02-15 23:15:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2023-02-15 23:15:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-02-15 23:15:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12092 backedges. 535 proven. 1641 refuted. 0 times theorem prover too weak. 9916 trivial. 0 not checked. [2023-02-15 23:15:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938375335] [2023-02-15 23:15:14,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938375335] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:14,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208688103] [2023-02-15 23:15:14,807 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:15:14,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:14,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:14,825 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:14,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2023-02-15 23:15:14,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-15 23:15:14,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:14,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 23:15:14,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12092 backedges. 5872 proven. 176 refuted. 0 times theorem prover too weak. 6044 trivial. 0 not checked. [2023-02-15 23:15:15,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12092 backedges. 449 proven. 1618 refuted. 0 times theorem prover too weak. 10025 trivial. 0 not checked. [2023-02-15 23:15:15,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208688103] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:15,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:15,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 31 [2023-02-15 23:15:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045950571] [2023-02-15 23:15:15,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:15,952 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:15:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 23:15:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2023-02-15 23:15:15,953 INFO L87 Difference]: Start difference. First operand 1489 states and 1730 transitions. cyclomatic complexity: 264 Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 14 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2023-02-15 23:15:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:16,412 INFO L93 Difference]: Finished difference Result 1462 states and 1671 transitions. [2023-02-15 23:15:16,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1462 states and 1671 transitions. [2023-02-15 23:15:16,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:16,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1462 states to 1155 states and 1318 transitions. [2023-02-15 23:15:16,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2023-02-15 23:15:16,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2023-02-15 23:15:16,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1155 states and 1318 transitions. [2023-02-15 23:15:16,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:16,420 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1155 states and 1318 transitions. [2023-02-15 23:15:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states and 1318 transitions. [2023-02-15 23:15:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1053. [2023-02-15 23:15:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 727 states have (on average 1.0371389270976616) internal successors, (754), 748 states have internal predecessors, (754), 188 states have call successors, (195), 127 states have call predecessors, (195), 138 states have return successors, (233), 177 states have call predecessors, (233), 188 states have call successors, (233) [2023-02-15 23:15:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1182 transitions. [2023-02-15 23:15:16,443 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1053 states and 1182 transitions. [2023-02-15 23:15:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 23:15:16,444 INFO L428 stractBuchiCegarLoop]: Abstraction has 1053 states and 1182 transitions. [2023-02-15 23:15:16,444 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-02-15 23:15:16,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1053 states and 1182 transitions. [2023-02-15 23:15:16,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:16,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:16,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:16,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [49, 49, 35, 21, 16, 16, 16, 16, 16, 16, 14, 14, 12, 12, 12, 11, 11, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1] [2023-02-15 23:15:16,448 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [63, 63, 52, 31, 26, 26, 26, 26, 26, 26, 21, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1] [2023-02-15 23:15:16,449 INFO L748 eck$LassoCheckResult]: Stem: 133327#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 133285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 133286#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 133279#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 133280#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 133339#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133399#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133400#$Ultimate##0 ~p := #in~p;~q := #in~q; 133402#L20 assume ~p <= 0;#res := 1; 133401#partsFINAL assume true; 133398#partsEXIT >#68#return; 133397#L36-1 havoc main_#t~ret8#1; 133396#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133394#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133391#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133392#$Ultimate##0 ~p := #in~p;~q := #in~q; 133395#L20 assume ~p <= 0;#res := 1; 133393#partsFINAL assume true; 133390#partsEXIT >#68#return; 133389#L36-1 havoc main_#t~ret8#1; 133388#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133386#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133384#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133379#$Ultimate##0 ~p := #in~p;~q := #in~q; 133387#L20 assume ~p <= 0;#res := 1; 133385#partsFINAL assume true; 133383#partsEXIT >#68#return; 133382#L36-1 havoc main_#t~ret8#1; 133381#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133380#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133364#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133378#$Ultimate##0 ~p := #in~p;~q := #in~q; 133374#L20 assume ~p <= 0;#res := 1; 133375#partsFINAL assume true; 133363#partsEXIT >#68#return; 133365#L36-1 havoc main_#t~ret8#1; 133519#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133518#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 133517#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 133516#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 133515#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133513#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133514#$Ultimate##0 ~p := #in~p;~q := #in~q; 133528#L20 assume !(~p <= 0); 133524#L21 assume ~q <= 0;#res := 0; 133522#partsFINAL assume true; 133512#partsEXIT >#68#return; 133510#L36-1 havoc main_#t~ret8#1; 133508#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133506#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133478#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133479#$Ultimate##0 ~p := #in~p;~q := #in~q; 133587#L20 assume !(~p <= 0); 133585#L21 assume !(~q <= 0); 133584#L22 assume !(~q > ~p); 133564#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133565#$Ultimate##0 ~p := #in~p;~q := #in~q; 133577#L20 assume ~p <= 0;#res := 1; 133576#partsFINAL assume true; 133563#partsEXIT >#64#return; 133560#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133561#$Ultimate##0 ~p := #in~p;~q := #in~q; 133573#L20 assume !(~p <= 0); 133572#L21 assume ~q <= 0;#res := 0; 133571#partsFINAL assume true; 133559#partsEXIT >#66#return; 133505#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133504#partsFINAL assume true; 133477#partsEXIT >#68#return; 133473#L36-1 havoc main_#t~ret8#1; 133440#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133441#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133438#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133368#$Ultimate##0 ~p := #in~p;~q := #in~q; 133741#L20 assume !(~p <= 0); 133739#L21 assume !(~q <= 0); 133675#L22 assume ~q > ~p; 133484#L22-1 call #t~ret0 := parts(~p, ~p);< 133485#$Ultimate##0 ~p := #in~p;~q := #in~q; 133616#L20 assume !(~p <= 0); 133610#L21 assume !(~q <= 0); 133602#L22 assume !(~q > ~p); 133552#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133553#$Ultimate##0 ~p := #in~p;~q := #in~q; 133603#L20 assume ~p <= 0;#res := 1; 133600#partsFINAL assume true; 133551#partsEXIT >#64#return; 133499#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133500#$Ultimate##0 ~p := #in~p;~q := #in~q; 133550#L20 assume !(~p <= 0); 133548#L21 assume ~q <= 0;#res := 0; 133546#partsFINAL assume true; 133498#partsEXIT >#66#return; 133494#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133490#partsFINAL assume true; 133483#partsEXIT >#62#return; 133475#L22-2 #res := #t~ret0;havoc #t~ret0; 133471#partsFINAL assume true; 133457#partsEXIT >#68#return; 133456#L36-1 havoc main_#t~ret8#1; 133455#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133454#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133366#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133367#$Ultimate##0 ~p := #in~p;~q := #in~q; 133417#L20 assume !(~p <= 0); 133418#L21 assume !(~q <= 0); 133410#L22 assume ~q > ~p; 133408#L22-1 call #t~ret0 := parts(~p, ~p);< 133434#$Ultimate##0 ~p := #in~p;~q := #in~q; 133433#L20 assume !(~p <= 0); 133430#L21 assume !(~q <= 0); 133431#L22 assume !(~q > ~p); 133426#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133594#$Ultimate##0 ~p := #in~p;~q := #in~q; 133429#L20 assume ~p <= 0;#res := 1; 133425#partsFINAL assume true; 133427#partsEXIT >#64#return; 133415#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133416#$Ultimate##0 ~p := #in~p;~q := #in~q; 133596#L20 assume !(~p <= 0); 133595#L21 assume ~q <= 0;#res := 0; 133593#partsFINAL assume true; 133414#partsEXIT >#66#return; 133411#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133407#partsFINAL assume true; 133409#partsEXIT >#62#return; 133376#L22-2 #res := #t~ret0;havoc #t~ret0; 133377#partsFINAL assume true; 133446#partsEXIT >#68#return; 133347#L36-1 havoc main_#t~ret8#1; 133345#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133343#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 133294#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 133295#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 133340#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133526#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133527#$Ultimate##0 ~p := #in~p;~q := #in~q; 133533#L20 assume !(~p <= 0); 133531#L21 assume ~q <= 0;#res := 0; 133529#partsFINAL assume true; 133525#partsEXIT >#68#return; 133523#L36-1 havoc main_#t~ret8#1; 133521#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133487#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133448#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133451#$Ultimate##0 ~p := #in~p;~q := #in~q; 133549#L20 assume !(~p <= 0); 133547#L21 assume !(~q <= 0); 133545#L22 assume !(~q > ~p); 133496#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133497#$Ultimate##0 ~p := #in~p;~q := #in~q; 133583#L20 assume !(~p <= 0); 133582#L21 assume !(~q <= 0); 133581#L22 assume !(~q > ~p); 133538#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133539#$Ultimate##0 ~p := #in~p;~q := #in~q; 133541#L20 assume ~p <= 0;#res := 1; 133540#partsFINAL assume true; 133537#partsEXIT >#64#return; 133535#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133536#$Ultimate##0 ~p := #in~p;~q := #in~q; 133544#L20 assume !(~p <= 0); 133543#L21 assume ~q <= 0;#res := 0; 133542#partsFINAL assume true; 133534#partsEXIT >#66#return; 133532#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133530#partsFINAL assume true; 133495#partsEXIT >#64#return; 133492#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133493#$Ultimate##0 ~p := #in~p;~q := #in~q; 133511#L20 assume !(~p <= 0); 133509#L21 assume ~q <= 0;#res := 0; 133507#partsFINAL assume true; 133491#partsEXIT >#66#return; 133489#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133488#partsFINAL assume true; 133447#partsEXIT >#68#return; 133449#L36-1 havoc main_#t~ret8#1; 133946#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133941#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133940#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133928#$Ultimate##0 ~p := #in~p;~q := #in~q; 133986#L20 assume !(~p <= 0); 133981#L21 assume !(~q <= 0); 133976#L22 assume !(~q > ~p); 133978#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134095#$Ultimate##0 ~p := #in~p;~q := #in~q; 134115#L20 assume ~p <= 0;#res := 1; 134112#partsFINAL assume true; 134094#partsEXIT >#64#return; 134027#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134028#$Ultimate##0 ~p := #in~p;~q := #in~q; 134104#L20 assume !(~p <= 0); 134102#L21 assume !(~q <= 0); 134101#L22 assume !(~q > ~p); 134098#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134100#$Ultimate##0 ~p := #in~p;~q := #in~q; 134143#L20 assume !(~p <= 0); 134141#L21 assume !(~q <= 0); 134139#L22 assume !(~q > ~p); 134135#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134137#$Ultimate##0 ~p := #in~p;~q := #in~q; 134140#L20 assume ~p <= 0;#res := 1; 134138#partsFINAL assume true; 134134#partsEXIT >#64#return; 134129#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134132#$Ultimate##0 ~p := #in~p;~q := #in~q; 134149#L20 assume !(~p <= 0); 134147#L21 assume ~q <= 0;#res := 0; 134144#partsFINAL assume true; 134128#partsEXIT >#66#return; 134131#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134287#partsFINAL assume true; 134286#partsEXIT >#64#return; 134282#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134284#$Ultimate##0 ~p := #in~p;~q := #in~q; 134293#L20 assume !(~p <= 0); 134292#L21 assume ~q <= 0;#res := 0; 134291#partsFINAL assume true; 134280#partsEXIT >#66#return; 133965#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134238#partsFINAL assume true; 134234#partsEXIT >#66#return; 134224#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134223#partsFINAL assume true; 133939#partsEXIT >#68#return; 133938#L36-1 havoc main_#t~ret8#1; 133936#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133932#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133774#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133923#$Ultimate##0 ~p := #in~p;~q := #in~q; 133918#L20 assume !(~p <= 0); 133915#L21 assume !(~q <= 0); 133912#L22 assume ~q > ~p; 133297#L22-1 call #t~ret0 := parts(~p, ~p);< 133858#$Ultimate##0 ~p := #in~p;~q := #in~q; 133854#L20 assume !(~p <= 0); 133850#L21 assume !(~q <= 0); 133296#L22 assume !(~q > ~p); 133298#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133841#$Ultimate##0 ~p := #in~p;~q := #in~q; 133842#L20 assume ~p <= 0;#res := 1; 133837#partsFINAL assume true; 133838#partsEXIT >#64#return; 133786#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133891#$Ultimate##0 ~p := #in~p;~q := #in~q; 133890#L20 assume !(~p <= 0); 133889#L21 assume !(~q <= 0); 133886#L22 assume !(~q > ~p); 133887#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133906#$Ultimate##0 ~p := #in~p;~q := #in~q; 133922#L20 assume !(~p <= 0); 133917#L21 assume !(~q <= 0); 133914#L22 assume ~q > ~p; 133910#L22-1 call #t~ret0 := parts(~p, ~p);< 133911#$Ultimate##0 ~p := #in~p;~q := #in~q; 133937#L20 assume !(~p <= 0); 133935#L21 assume !(~q <= 0); 133931#L22 assume !(~q > ~p); 133926#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133927#$Ultimate##0 ~p := #in~p;~q := #in~q; 133934#L20 assume ~p <= 0;#res := 1; 133930#partsFINAL assume true; 133925#partsEXIT >#64#return; 133920#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133921#$Ultimate##0 ~p := #in~p;~q := #in~q; 133933#L20 assume !(~p <= 0); 133929#L21 assume ~q <= 0;#res := 0; 133924#partsFINAL assume true; 133919#partsEXIT >#66#return; 133916#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133913#partsFINAL assume true; 133909#partsEXIT >#62#return; 133908#L22-2 #res := #t~ret0;havoc #t~ret0; 133907#partsFINAL assume true; 133902#partsEXIT >#64#return; 133879#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133898#$Ultimate##0 ~p := #in~p;~q := #in~q; 133897#L20 assume !(~p <= 0); 133896#L21 assume !(~q <= 0); 133894#L22 assume !(~q > ~p); 133895#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133906#$Ultimate##0 ~p := #in~p;~q := #in~q; 133922#L20 assume !(~p <= 0); 133917#L21 assume !(~q <= 0); 133914#L22 assume ~q > ~p; 133910#L22-1 call #t~ret0 := parts(~p, ~p);< 133911#$Ultimate##0 ~p := #in~p;~q := #in~q; 133937#L20 assume !(~p <= 0); 133935#L21 assume !(~q <= 0); 133931#L22 assume !(~q > ~p); 133926#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133927#$Ultimate##0 ~p := #in~p;~q := #in~q; 133934#L20 assume ~p <= 0;#res := 1; 133930#partsFINAL assume true; 133925#partsEXIT >#64#return; 133920#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133921#$Ultimate##0 ~p := #in~p;~q := #in~q; 133933#L20 assume !(~p <= 0); 133929#L21 assume ~q <= 0;#res := 0; 133924#partsFINAL assume true; 133919#partsEXIT >#66#return; 133916#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133913#partsFINAL assume true; 133909#partsEXIT >#62#return; 133908#L22-2 #res := #t~ret0;havoc #t~ret0; 133907#partsFINAL assume true; 133902#partsEXIT >#64#return; 133878#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133898#$Ultimate##0 ~p := #in~p;~q := #in~q; 133897#L20 assume !(~p <= 0); 133896#L21 assume !(~q <= 0); 133894#L22 assume !(~q > ~p); 133846#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133856#$Ultimate##0 ~p := #in~p;~q := #in~q; 133857#L20 assume !(~p <= 0); 133844#L21 assume !(~q <= 0); 133848#L22 assume !(~q > ~p); 133265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133860#$Ultimate##0 ~p := #in~p;~q := #in~q; 133852#L20 assume !(~p <= 0); 133853#L21 assume !(~q <= 0); 133843#L22 assume !(~q > ~p); 133287#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133288#$Ultimate##0 ~p := #in~p;~q := #in~q; 133954#L20 assume ~p <= 0;#res := 1; 133953#partsFINAL assume true; 133948#partsEXIT >#64#return; 133943#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133945#$Ultimate##0 ~p := #in~p;~q := #in~q; 133952#L20 assume !(~p <= 0); 133951#L21 assume ~q <= 0;#res := 0; 133947#partsFINAL assume true; 133942#partsEXIT >#66#return; 133317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133318#partsFINAL assume true; 133264#partsEXIT >#64#return; 133267#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133272#$Ultimate##0 ~p := #in~p;~q := #in~q; 133309#L20 assume !(~p <= 0); 133305#L21 assume ~q <= 0;#res := 0; 133306#partsFINAL assume true; 134316#partsEXIT >#66#return; 134315#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134314#partsFINAL assume true; 134311#partsEXIT >#64#return; 134308#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134309#$Ultimate##0 ~p := #in~p;~q := #in~q; 134313#L20 assume !(~p <= 0); 134312#L21 assume ~q <= 0;#res := 0; 134310#partsFINAL assume true; 134307#partsEXIT >#66#return; 134222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134306#partsFINAL assume true; 134221#partsEXIT >#66#return; 134222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134306#partsFINAL assume true; 134221#partsEXIT >#66#return; 134220#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134219#partsFINAL assume true; 134216#partsEXIT >#66#return; 134215#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134214#partsFINAL assume true; 133776#partsEXIT >#62#return; 133778#L22-2 #res := #t~ret0;havoc #t~ret0; 133773#partsFINAL assume true; 133775#partsEXIT >#68#return; 134194#L36-1 [2023-02-15 23:15:16,449 INFO L750 eck$LassoCheckResult]: Loop: 134194#L36-1 havoc main_#t~ret8#1; 134193#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 134191#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 133292#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 133293#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 133356#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133350#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133351#$Ultimate##0 ~p := #in~p;~q := #in~q; 133357#L20 assume !(~p <= 0); 133355#L21 assume ~q <= 0;#res := 0; 133352#partsFINAL assume true; 133349#partsEXIT >#68#return; 133336#L36-1 havoc main_#t~ret8#1; 133332#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133302#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133281#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133282#$Ultimate##0 ~p := #in~p;~q := #in~q; 134088#L20 assume !(~p <= 0); 134087#L21 assume !(~q <= 0); 134085#L22 assume !(~q > ~p); 134061#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134062#$Ultimate##0 ~p := #in~p;~q := #in~q; 134198#L20 assume !(~p <= 0); 134197#L21 assume !(~q <= 0); 134196#L22 assume !(~q > ~p); 134077#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134078#$Ultimate##0 ~p := #in~p;~q := #in~q; 134122#L20 assume !(~p <= 0); 134121#L21 assume !(~q <= 0); 134119#L22 assume !(~q > ~p); 134076#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134078#$Ultimate##0 ~p := #in~p;~q := #in~q; 134122#L20 assume !(~p <= 0); 134121#L21 assume !(~q <= 0); 134119#L22 assume !(~q > ~p); 134120#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134213#$Ultimate##0 ~p := #in~p;~q := #in~q; 134218#L20 assume ~p <= 0;#res := 1; 134217#partsFINAL assume true; 134212#partsEXIT >#64#return; 134204#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134205#$Ultimate##0 ~p := #in~p;~q := #in~q; 134211#L20 assume !(~p <= 0); 134209#L21 assume ~q <= 0;#res := 0; 134207#partsFINAL assume true; 134203#partsEXIT >#66#return; 134201#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134199#partsFINAL assume true; 134175#partsEXIT >#64#return; 134171#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134172#$Ultimate##0 ~p := #in~p;~q := #in~q; 134189#L20 assume !(~p <= 0); 134183#L21 assume ~q <= 0;#res := 0; 134174#partsFINAL assume true; 134169#partsEXIT >#66#return; 134070#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134304#partsFINAL assume true; 134074#partsEXIT >#64#return; 134069#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134071#$Ultimate##0 ~p := #in~p;~q := #in~q; 134118#L20 assume !(~p <= 0); 134117#L21 assume ~q <= 0;#res := 0; 134116#partsFINAL assume true; 134067#partsEXIT >#66#return; 134065#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134064#partsFINAL assume true; 134059#partsEXIT >#64#return; 134055#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134057#$Ultimate##0 ~p := #in~p;~q := #in~q; 134106#L20 assume !(~p <= 0); 134105#L21 assume ~q <= 0;#res := 0; 134066#partsFINAL assume true; 134053#partsEXIT >#66#return; 134049#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134048#partsFINAL assume true; 134046#partsEXIT >#68#return; 134045#L36-1 havoc main_#t~ret8#1; 134043#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 134042#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133283#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133284#$Ultimate##0 ~p := #in~p;~q := #in~q; 134063#L20 assume !(~p <= 0); 134058#L21 assume !(~q <= 0); 134050#L22 assume !(~q > ~p); 133971#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133972#$Ultimate##0 ~p := #in~p;~q := #in~q; 133994#L20 assume !(~p <= 0); 133990#L21 assume !(~q <= 0); 133988#L22 assume ~q > ~p; 133984#L22-1 call #t~ret0 := parts(~p, ~p);< 133985#$Ultimate##0 ~p := #in~p;~q := #in~q; 134006#L20 assume !(~p <= 0); 134005#L21 assume !(~q <= 0); 134003#L22 assume !(~q > ~p); 134000#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134001#$Ultimate##0 ~p := #in~p;~q := #in~q; 134004#L20 assume ~p <= 0;#res := 1; 134002#partsFINAL assume true; 133999#partsEXIT >#64#return; 133992#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133993#$Ultimate##0 ~p := #in~p;~q := #in~q; 133998#L20 assume !(~p <= 0); 133997#L21 assume ~q <= 0;#res := 0; 133996#partsFINAL assume true; 133991#partsEXIT >#66#return; 133989#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133987#partsFINAL assume true; 133983#partsEXIT >#62#return; 133980#L22-2 #res := #t~ret0;havoc #t~ret0; 133974#partsFINAL assume true; 133968#partsEXIT >#64#return; 133275#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133278#$Ultimate##0 ~p := #in~p;~q := #in~q; 134300#L20 assume !(~p <= 0); 134301#L21 assume !(~q <= 0); 133299#L22 assume !(~q > ~p); 133301#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134100#$Ultimate##0 ~p := #in~p;~q := #in~q; 134143#L20 assume !(~p <= 0); 134141#L21 assume !(~q <= 0); 134142#L22 assume !(~q > ~p); 133320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134114#$Ultimate##0 ~p := #in~p;~q := #in~q; 134133#L20 assume !(~p <= 0); 134126#L21 assume !(~q <= 0); 134127#L22 assume !(~q > ~p); 134136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134137#$Ultimate##0 ~p := #in~p;~q := #in~q; 134140#L20 assume ~p <= 0;#res := 1; 134138#partsFINAL assume true; 134134#partsEXIT >#64#return; 134130#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134132#$Ultimate##0 ~p := #in~p;~q := #in~q; 134149#L20 assume !(~p <= 0); 134147#L21 assume ~q <= 0;#res := 0; 134144#partsFINAL assume true; 134128#partsEXIT >#66#return; 134125#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134123#partsFINAL assume true; 134113#partsEXIT >#64#return; 134110#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134111#$Ultimate##0 ~p := #in~p;~q := #in~q; 134160#L20 assume !(~p <= 0); 134158#L21 assume ~q <= 0;#res := 0; 134155#partsFINAL assume true; 134108#partsEXIT >#66#return; 134107#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134103#partsFINAL assume true; 134096#partsEXIT >#64#return; 134035#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134037#$Ultimate##0 ~p := #in~p;~q := #in~q; 134081#L20 assume !(~p <= 0); 134080#L21 assume ~q <= 0;#res := 0; 134079#partsFINAL assume true; 134033#partsEXIT >#66#return; 134036#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134305#partsFINAL assume true; 134038#partsEXIT >#66#return; 134040#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134044#partsFINAL assume true; 134024#partsEXIT >#68#return; 133337#L36-1 havoc main_#t~ret8#1; 133333#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 133303#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133304#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133284#$Ultimate##0 ~p := #in~p;~q := #in~q; 134063#L20 assume !(~p <= 0); 134058#L21 assume !(~q <= 0); 134050#L22 assume !(~q > ~p); 133971#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133972#$Ultimate##0 ~p := #in~p;~q := #in~q; 133994#L20 assume !(~p <= 0); 133990#L21 assume !(~q <= 0); 133988#L22 assume ~q > ~p; 133984#L22-1 call #t~ret0 := parts(~p, ~p);< 133985#$Ultimate##0 ~p := #in~p;~q := #in~q; 134006#L20 assume !(~p <= 0); 134005#L21 assume !(~q <= 0); 134003#L22 assume !(~q > ~p); 134000#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134001#$Ultimate##0 ~p := #in~p;~q := #in~q; 134004#L20 assume ~p <= 0;#res := 1; 134002#partsFINAL assume true; 133999#partsEXIT >#64#return; 133992#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133993#$Ultimate##0 ~p := #in~p;~q := #in~q; 133998#L20 assume !(~p <= 0); 133997#L21 assume ~q <= 0;#res := 0; 133996#partsFINAL assume true; 133991#partsEXIT >#66#return; 133989#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133987#partsFINAL assume true; 133983#partsEXIT >#62#return; 133980#L22-2 #res := #t~ret0;havoc #t~ret0; 133974#partsFINAL assume true; 133968#partsEXIT >#64#return; 133275#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133278#$Ultimate##0 ~p := #in~p;~q := #in~q; 134300#L20 assume !(~p <= 0); 134301#L21 assume !(~q <= 0); 133299#L22 assume !(~q > ~p); 133301#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134100#$Ultimate##0 ~p := #in~p;~q := #in~q; 134143#L20 assume !(~p <= 0); 134141#L21 assume !(~q <= 0); 134142#L22 assume !(~q > ~p); 133320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134114#$Ultimate##0 ~p := #in~p;~q := #in~q; 134133#L20 assume !(~p <= 0); 134126#L21 assume !(~q <= 0); 134127#L22 assume !(~q > ~p); 134136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134137#$Ultimate##0 ~p := #in~p;~q := #in~q; 134140#L20 assume ~p <= 0;#res := 1; 134138#partsFINAL assume true; 134134#partsEXIT >#64#return; 134130#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134132#$Ultimate##0 ~p := #in~p;~q := #in~q; 134149#L20 assume !(~p <= 0); 134147#L21 assume ~q <= 0;#res := 0; 134144#partsFINAL assume true; 134128#partsEXIT >#66#return; 134125#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134123#partsFINAL assume true; 134113#partsEXIT >#64#return; 134110#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134111#$Ultimate##0 ~p := #in~p;~q := #in~q; 134160#L20 assume !(~p <= 0); 134158#L21 assume ~q <= 0;#res := 0; 134155#partsFINAL assume true; 134108#partsEXIT >#66#return; 134107#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134103#partsFINAL assume true; 134096#partsEXIT >#64#return; 134035#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134037#$Ultimate##0 ~p := #in~p;~q := #in~q; 134081#L20 assume !(~p <= 0); 134080#L21 assume ~q <= 0;#res := 0; 134079#partsFINAL assume true; 134033#partsEXIT >#66#return; 134036#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134305#partsFINAL assume true; 134038#partsEXIT >#66#return; 134040#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134044#partsFINAL assume true; 134024#partsEXIT >#68#return; 134022#L36-1 havoc main_#t~ret8#1; 134020#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 134017#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 134010#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 133284#$Ultimate##0 ~p := #in~p;~q := #in~q; 134063#L20 assume !(~p <= 0); 134058#L21 assume !(~q <= 0); 134050#L22 assume !(~q > ~p); 134052#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134267#$Ultimate##0 ~p := #in~p;~q := #in~q; 134269#L20 assume ~p <= 0;#res := 1; 134268#partsFINAL assume true; 134266#partsEXIT >#64#return; 134262#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134264#$Ultimate##0 ~p := #in~p;~q := #in~q; 134285#L20 assume !(~p <= 0); 134279#L21 assume !(~q <= 0); 134278#L22 assume !(~q > ~p); 133311#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133310#$Ultimate##0 ~p := #in~p;~q := #in~q; 133316#L20 assume !(~p <= 0); 134276#L21 assume !(~q <= 0); 134275#L22 assume ~q > ~p; 133290#L22-1 call #t~ret0 := parts(~p, ~p);< 133326#$Ultimate##0 ~p := #in~p;~q := #in~q; 134302#L20 assume !(~p <= 0); 134294#L21 assume !(~q <= 0); 134295#L22 assume !(~q > ~p); 133289#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133291#$Ultimate##0 ~p := #in~p;~q := #in~q; 133338#L20 assume ~p <= 0;#res := 1; 133334#partsFINAL assume true; 133335#partsEXIT >#64#return; 133270#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134298#$Ultimate##0 ~p := #in~p;~q := #in~q; 134303#L20 assume !(~p <= 0); 133307#L21 assume ~q <= 0;#res := 0; 133308#partsFINAL assume true; 133269#partsEXIT >#66#return; 133271#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134296#partsFINAL assume true; 134297#partsEXIT >#62#return; 133330#L22-2 #res := #t~ret0;havoc #t~ret0; 133331#partsFINAL assume true; 134270#partsEXIT >#64#return; 133276#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133278#$Ultimate##0 ~p := #in~p;~q := #in~q; 134300#L20 assume !(~p <= 0); 134301#L21 assume !(~q <= 0); 133299#L22 assume !(~q > ~p); 133301#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134100#$Ultimate##0 ~p := #in~p;~q := #in~q; 134143#L20 assume !(~p <= 0); 134141#L21 assume !(~q <= 0); 134142#L22 assume !(~q > ~p); 133320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134114#$Ultimate##0 ~p := #in~p;~q := #in~q; 134133#L20 assume !(~p <= 0); 134126#L21 assume !(~q <= 0); 134127#L22 assume !(~q > ~p); 134136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 134137#$Ultimate##0 ~p := #in~p;~q := #in~q; 134140#L20 assume ~p <= 0;#res := 1; 134138#partsFINAL assume true; 134134#partsEXIT >#64#return; 134130#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134132#$Ultimate##0 ~p := #in~p;~q := #in~q; 134149#L20 assume !(~p <= 0); 134147#L21 assume ~q <= 0;#res := 0; 134144#partsFINAL assume true; 134128#partsEXIT >#66#return; 134125#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134123#partsFINAL assume true; 134113#partsEXIT >#64#return; 134110#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134111#$Ultimate##0 ~p := #in~p;~q := #in~q; 134160#L20 assume !(~p <= 0); 134158#L21 assume ~q <= 0;#res := 0; 134155#partsFINAL assume true; 134108#partsEXIT >#66#return; 134107#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134103#partsFINAL assume true; 134096#partsEXIT >#64#return; 134035#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134037#$Ultimate##0 ~p := #in~p;~q := #in~q; 134081#L20 assume !(~p <= 0); 134080#L21 assume ~q <= 0;#res := 0; 134079#partsFINAL assume true; 134033#partsEXIT >#66#return; 134036#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134305#partsFINAL assume true; 134038#partsEXIT >#66#return; 134039#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134265#partsFINAL assume true; 134261#partsEXIT >#66#return; 134240#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134239#partsFINAL assume true; 134009#partsEXIT >#68#return; 133871#L36-1 havoc main_#t~ret8#1; 133872#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 134016#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 133324#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 134014#$Ultimate##0 ~p := #in~p;~q := #in~q; 133870#L20 assume !(~p <= 0); 133772#L21 assume !(~q <= 0); 133348#L22 assume ~q > ~p; 133323#L22-1 call #t~ret0 := parts(~p, ~p);< 133325#$Ultimate##0 ~p := #in~p;~q := #in~q; 133901#L20 assume !(~p <= 0); 133900#L21 assume !(~q <= 0); 133899#L22 assume !(~q > ~p); 133833#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133834#$Ultimate##0 ~p := #in~p;~q := #in~q; 133839#L20 assume ~p <= 0;#res := 1; 133840#partsFINAL assume true; 133832#partsEXIT >#64#return; 133789#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133790#$Ultimate##0 ~p := #in~p;~q := #in~q; 134008#L20 assume !(~p <= 0); 134007#L21 assume !(~q <= 0); 133995#L22 assume !(~q > ~p); 133904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133906#$Ultimate##0 ~p := #in~p;~q := #in~q; 133922#L20 assume !(~p <= 0); 133917#L21 assume !(~q <= 0); 133914#L22 assume ~q > ~p; 133910#L22-1 call #t~ret0 := parts(~p, ~p);< 133911#$Ultimate##0 ~p := #in~p;~q := #in~q; 133937#L20 assume !(~p <= 0); 133935#L21 assume !(~q <= 0); 133931#L22 assume !(~q > ~p); 133926#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133927#$Ultimate##0 ~p := #in~p;~q := #in~q; 133934#L20 assume ~p <= 0;#res := 1; 133930#partsFINAL assume true; 133925#partsEXIT >#64#return; 133920#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133921#$Ultimate##0 ~p := #in~p;~q := #in~q; 133933#L20 assume !(~p <= 0); 133929#L21 assume ~q <= 0;#res := 0; 133924#partsFINAL assume true; 133919#partsEXIT >#66#return; 133916#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133913#partsFINAL assume true; 133909#partsEXIT >#62#return; 133908#L22-2 #res := #t~ret0;havoc #t~ret0; 133907#partsFINAL assume true; 133902#partsEXIT >#64#return; 133881#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133882#$Ultimate##0 ~p := #in~p;~q := #in~q; 133982#L20 assume !(~p <= 0); 133979#L21 assume !(~q <= 0); 133973#L22 assume !(~q > ~p); 133845#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133856#$Ultimate##0 ~p := #in~p;~q := #in~q; 133857#L20 assume !(~p <= 0); 133844#L21 assume !(~q <= 0); 133848#L22 assume !(~q > ~p); 133265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133860#$Ultimate##0 ~p := #in~p;~q := #in~q; 133852#L20 assume !(~p <= 0); 133853#L21 assume !(~q <= 0); 133843#L22 assume !(~q > ~p); 133287#L23 call #t~ret1 := parts(~p - ~q, ~q);< 133288#$Ultimate##0 ~p := #in~p;~q := #in~q; 133954#L20 assume ~p <= 0;#res := 1; 133953#partsFINAL assume true; 133948#partsEXIT >#64#return; 133943#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133945#$Ultimate##0 ~p := #in~p;~q := #in~q; 133952#L20 assume !(~p <= 0); 133951#L21 assume ~q <= 0;#res := 0; 133947#partsFINAL assume true; 133942#partsEXIT >#66#return; 133317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 133318#partsFINAL assume true; 133264#partsEXIT >#64#return; 133267#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 133272#$Ultimate##0 ~p := #in~p;~q := #in~q; 133309#L20 assume !(~p <= 0); 133305#L21 assume ~q <= 0;#res := 0; 133306#partsFINAL assume true; 134316#partsEXIT >#66#return; 134315#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134314#partsFINAL assume true; 134311#partsEXIT >#64#return; 134308#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 134309#$Ultimate##0 ~p := #in~p;~q := #in~q; 134313#L20 assume !(~p <= 0); 134312#L21 assume ~q <= 0;#res := 0; 134310#partsFINAL assume true; 134307#partsEXIT >#66#return; 134222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134306#partsFINAL assume true; 134221#partsEXIT >#66#return; 134220#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134219#partsFINAL assume true; 134216#partsEXIT >#66#return; 134215#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 134214#partsFINAL assume true; 133776#partsEXIT >#62#return; 133328#L22-2 #res := #t~ret0;havoc #t~ret0; 133329#partsFINAL assume true; 134195#partsEXIT >#68#return; 134194#L36-1 [2023-02-15 23:15:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1517021388, now seen corresponding path program 8 times [2023-02-15 23:15:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079627808] [2023-02-15 23:15:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:15:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 23:15:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-15 23:15:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-15 23:15:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 23:15:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-02-15 23:15:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-02-15 23:15:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-02-15 23:15:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-02-15 23:15:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 650 proven. 402 refuted. 0 times theorem prover too weak. 5108 trivial. 0 not checked. [2023-02-15 23:15:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079627808] [2023-02-15 23:15:16,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079627808] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806986829] [2023-02-15 23:15:16,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:15:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:16,959 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2023-02-15 23:15:17,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:15:17,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:17,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 23:15:17,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 649 proven. 403 refuted. 0 times theorem prover too weak. 5108 trivial. 0 not checked. [2023-02-15 23:15:17,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 645 proven. 412 refuted. 0 times theorem prover too weak. 5103 trivial. 0 not checked. [2023-02-15 23:15:17,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806986829] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:17,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:17,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 18 [2023-02-15 23:15:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702114467] [2023-02-15 23:15:17,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:17,896 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:15:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash -171091731, now seen corresponding path program 6 times [2023-02-15 23:15:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814527093] [2023-02-15 23:15:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 23:15:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 23:15:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-15 23:15:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-02-15 23:15:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-02-15 23:15:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-02-15 23:15:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10664 backedges. 208 proven. 1708 refuted. 0 times theorem prover too weak. 8748 trivial. 0 not checked. [2023-02-15 23:15:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814527093] [2023-02-15 23:15:18,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814527093] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629099888] [2023-02-15 23:15:18,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:15:18,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:18,553 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:18,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2023-02-15 23:15:18,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-15 23:15:18,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:18,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 23:15:18,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10664 backedges. 5848 proven. 45 refuted. 0 times theorem prover too weak. 4771 trivial. 0 not checked. [2023-02-15 23:15:18,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10664 backedges. 481 proven. 486 refuted. 0 times theorem prover too weak. 9697 trivial. 0 not checked. [2023-02-15 23:15:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629099888] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:19,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 12] total 32 [2023-02-15 23:15:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660248747] [2023-02-15 23:15:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:19,464 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:15:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 23:15:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-02-15 23:15:19,464 INFO L87 Difference]: Start difference. First operand 1053 states and 1182 transitions. cyclomatic complexity: 145 Second operand has 19 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 13 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (22), 12 states have call predecessors, (22), 13 states have call successors, (22) [2023-02-15 23:15:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:19,665 INFO L93 Difference]: Finished difference Result 1266 states and 1471 transitions. [2023-02-15 23:15:19,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1266 states and 1471 transitions. [2023-02-15 23:15:19,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:19,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1266 states to 1184 states and 1380 transitions. [2023-02-15 23:15:19,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2023-02-15 23:15:19,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 170 [2023-02-15 23:15:19,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1184 states and 1380 transitions. [2023-02-15 23:15:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:19,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1184 states and 1380 transitions. [2023-02-15 23:15:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states and 1380 transitions. [2023-02-15 23:15:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1089. [2023-02-15 23:15:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 754 states have (on average 1.0358090185676392) internal successors, (781), 773 states have internal predecessors, (781), 186 states have call successors, (194), 124 states have call predecessors, (194), 149 states have return successors, (248), 191 states have call predecessors, (248), 186 states have call successors, (248) [2023-02-15 23:15:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1223 transitions. [2023-02-15 23:15:19,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1089 states and 1223 transitions. [2023-02-15 23:15:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:15:19,685 INFO L428 stractBuchiCegarLoop]: Abstraction has 1089 states and 1223 transitions. [2023-02-15 23:15:19,685 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-02-15 23:15:19,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1089 states and 1223 transitions. [2023-02-15 23:15:19,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:15:19,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:19,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:19,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [71, 71, 53, 30, 25, 25, 25, 25, 25, 25, 23, 18, 17, 16, 16, 16, 16, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1] [2023-02-15 23:15:19,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 7, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:15:19,689 INFO L748 eck$LassoCheckResult]: Stem: 143108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 143056#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 143057#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 143054#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 143055#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 143126#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143209#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143210#$Ultimate##0 ~p := #in~p;~q := #in~q; 143212#L20 assume ~p <= 0;#res := 1; 143211#partsFINAL assume true; 143208#partsEXIT >#68#return; 143207#L36-1 havoc main_#t~ret8#1; 143206#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143204#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143201#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143202#$Ultimate##0 ~p := #in~p;~q := #in~q; 143205#L20 assume ~p <= 0;#res := 1; 143203#partsFINAL assume true; 143200#partsEXIT >#68#return; 143199#L36-1 havoc main_#t~ret8#1; 143198#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143196#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143194#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143189#$Ultimate##0 ~p := #in~p;~q := #in~q; 143197#L20 assume ~p <= 0;#res := 1; 143195#partsFINAL assume true; 143193#partsEXIT >#68#return; 143192#L36-1 havoc main_#t~ret8#1; 143191#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143190#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143185#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143188#$Ultimate##0 ~p := #in~p;~q := #in~q; 143184#L20 assume ~p <= 0;#res := 1; 143186#partsFINAL assume true; 143300#partsEXIT >#68#return; 143298#L36-1 havoc main_#t~ret8#1; 143294#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143290#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 143288#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 143286#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 143285#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143253#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143254#$Ultimate##0 ~p := #in~p;~q := #in~q; 143284#L20 assume !(~p <= 0); 143280#L21 assume ~q <= 0;#res := 0; 143276#partsFINAL assume true; 143252#partsEXIT >#68#return; 143247#L36-1 havoc main_#t~ret8#1; 143241#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143237#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143232#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143233#$Ultimate##0 ~p := #in~p;~q := #in~q; 143311#L20 assume !(~p <= 0); 143310#L21 assume !(~q <= 0); 143308#L22 assume !(~q > ~p); 143270#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143271#$Ultimate##0 ~p := #in~p;~q := #in~q; 143306#L20 assume ~p <= 0;#res := 1; 143304#partsFINAL assume true; 143269#partsEXIT >#64#return; 143243#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143244#$Ultimate##0 ~p := #in~p;~q := #in~q; 143260#L20 assume !(~p <= 0); 143258#L21 assume ~q <= 0;#res := 0; 143256#partsFINAL assume true; 143242#partsEXIT >#66#return; 143238#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143234#partsFINAL assume true; 143231#partsEXIT >#68#return; 143224#L36-1 havoc main_#t~ret8#1; 143225#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143334#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143181#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143323#$Ultimate##0 ~p := #in~p;~q := #in~q; 143353#L20 assume !(~p <= 0); 143351#L21 assume !(~q <= 0); 143350#L22 assume ~q > ~p; 143348#L22-1 call #t~ret0 := parts(~p, ~p);< 143349#$Ultimate##0 ~p := #in~p;~q := #in~q; 143364#L20 assume !(~p <= 0); 143362#L21 assume !(~q <= 0); 143361#L22 assume !(~q > ~p); 143359#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143360#$Ultimate##0 ~p := #in~p;~q := #in~q; 143365#L20 assume ~p <= 0;#res := 1; 143363#partsFINAL assume true; 143358#partsEXIT >#64#return; 143356#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143357#$Ultimate##0 ~p := #in~p;~q := #in~q; 143370#L20 assume !(~p <= 0); 143368#L21 assume ~q <= 0;#res := 0; 143366#partsFINAL assume true; 143355#partsEXIT >#66#return; 143354#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143352#partsFINAL assume true; 143347#partsEXIT >#62#return; 143346#L22-2 #res := #t~ret0;havoc #t~ret0; 143337#partsFINAL assume true; 143179#partsEXIT >#68#return; 143182#L36-1 havoc main_#t~ret8#1; 143329#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143326#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143180#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143324#$Ultimate##0 ~p := #in~p;~q := #in~q; 143339#L20 assume !(~p <= 0); 143338#L21 assume !(~q <= 0); 143217#L22 assume ~q > ~p; 143218#L22-1 call #t~ret0 := parts(~p, ~p);< 143331#$Ultimate##0 ~p := #in~p;~q := #in~q; 143376#L20 assume !(~p <= 0); 143374#L21 assume !(~q <= 0); 143372#L22 assume !(~q > ~p); 143344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143345#$Ultimate##0 ~p := #in~p;~q := #in~q; 143369#L20 assume ~p <= 0;#res := 1; 143367#partsFINAL assume true; 143343#partsEXIT >#64#return; 143341#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143342#$Ultimate##0 ~p := #in~p;~q := #in~q; 143375#L20 assume !(~p <= 0); 143373#L21 assume ~q <= 0;#res := 0; 143371#partsFINAL assume true; 143340#partsEXIT >#66#return; 143336#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143335#partsFINAL assume true; 143330#partsEXIT >#62#return; 143327#L22-2 #res := #t~ret0;havoc #t~ret0; 143325#partsFINAL assume true; 143322#partsEXIT >#68#return; 143319#L36-1 havoc main_#t~ret8#1; 143315#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143272#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 143268#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 143267#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 143266#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143263#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143265#$Ultimate##0 ~p := #in~p;~q := #in~q; 143305#L20 assume !(~p <= 0); 143303#L21 assume ~q <= 0;#res := 0; 143302#partsFINAL assume true; 143261#partsEXIT >#68#return; 143259#L36-1 havoc main_#t~ret8#1; 143257#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143255#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143249#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143251#$Ultimate##0 ~p := #in~p;~q := #in~q; 143333#L20 assume !(~p <= 0); 143332#L21 assume !(~q <= 0); 143328#L22 assume !(~q > ~p); 143282#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143283#$Ultimate##0 ~p := #in~p;~q := #in~q; 143378#L20 assume !(~p <= 0); 143301#L21 assume !(~q <= 0); 143299#L22 assume !(~q > ~p); 143296#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143297#$Ultimate##0 ~p := #in~p;~q := #in~q; 143309#L20 assume ~p <= 0;#res := 1; 143307#partsFINAL assume true; 143295#partsEXIT >#64#return; 143292#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143293#$Ultimate##0 ~p := #in~p;~q := #in~q; 143320#L20 assume !(~p <= 0); 143316#L21 assume ~q <= 0;#res := 0; 143312#partsFINAL assume true; 143291#partsEXIT >#66#return; 143289#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143287#partsFINAL assume true; 143281#partsEXIT >#64#return; 143278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143279#$Ultimate##0 ~p := #in~p;~q := #in~q; 143321#L20 assume !(~p <= 0); 143318#L21 assume ~q <= 0;#res := 0; 143314#partsFINAL assume true; 143277#partsEXIT >#66#return; 143275#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143274#partsFINAL assume true; 143248#partsEXIT >#68#return; 143226#L36-1 havoc main_#t~ret8#1; 143227#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143682#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143119#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143136#$Ultimate##0 ~p := #in~p;~q := #in~q; 143850#L20 assume !(~p <= 0); 143848#L21 assume !(~q <= 0); 143847#L22 assume !(~q > ~p); 143845#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143846#$Ultimate##0 ~p := #in~p;~q := #in~q; 143851#L20 assume ~p <= 0;#res := 1; 143849#partsFINAL assume true; 143844#partsEXIT >#64#return; 143819#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143828#$Ultimate##0 ~p := #in~p;~q := #in~q; 143875#L20 assume !(~p <= 0); 143869#L21 assume !(~q <= 0); 143867#L22 assume !(~q > ~p); 143862#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143865#$Ultimate##0 ~p := #in~p;~q := #in~q; 143889#L20 assume !(~p <= 0); 143885#L21 assume !(~q <= 0); 143886#L22 assume !(~q > ~p); 143907#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143908#$Ultimate##0 ~p := #in~p;~q := #in~q; 143915#L20 assume ~p <= 0;#res := 1; 143911#partsFINAL assume true; 143905#partsEXIT >#64#return; 143898#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143901#$Ultimate##0 ~p := #in~p;~q := #in~q; 143925#L20 assume !(~p <= 0); 143921#L21 assume ~q <= 0;#res := 0; 143909#partsFINAL assume true; 143897#partsEXIT >#66#return; 143900#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144070#partsFINAL assume true; 144067#partsEXIT >#64#return; 144062#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144065#$Ultimate##0 ~p := #in~p;~q := #in~q; 144071#L20 assume !(~p <= 0); 144069#L21 assume ~q <= 0;#res := 0; 144066#partsFINAL assume true; 144061#partsEXIT >#66#return; 144064#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144076#partsFINAL assume true; 144075#partsEXIT >#66#return; 144074#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143120#partsFINAL assume true; 143652#partsEXIT >#68#return; 143646#L36-1 havoc main_#t~ret8#1; 143640#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143638#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143114#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143137#$Ultimate##0 ~p := #in~p;~q := #in~q; 143737#L20 assume !(~p <= 0); 143733#L21 assume !(~q <= 0); 143731#L22 assume ~q > ~p; 143147#L22-1 call #t~ret0 := parts(~p, ~p);< 143729#$Ultimate##0 ~p := #in~p;~q := #in~q; 143146#L20 assume !(~p <= 0); 143148#L21 assume !(~q <= 0); 143741#L22 assume !(~q > ~p); 143739#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143740#$Ultimate##0 ~p := #in~p;~q := #in~q; 143743#L20 assume ~p <= 0;#res := 1; 143742#partsFINAL assume true; 143738#partsEXIT >#64#return; 143735#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143736#$Ultimate##0 ~p := #in~p;~q := #in~q; 144008#L20 assume !(~p <= 0); 143981#L21 assume !(~q <= 0); 143982#L22 assume !(~q > ~p); 143064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143153#$Ultimate##0 ~p := #in~p;~q := #in~q; 143154#L20 assume !(~p <= 0); 143142#L21 assume !(~q <= 0); 143078#L22 assume !(~q > ~p); 143062#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143066#$Ultimate##0 ~p := #in~p;~q := #in~q; 144044#L20 assume ~p <= 0;#res := 1; 144043#partsFINAL assume true; 144038#partsEXIT >#64#return; 144034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144036#$Ultimate##0 ~p := #in~p;~q := #in~q; 144042#L20 assume !(~p <= 0); 144041#L21 assume ~q <= 0;#res := 0; 144037#partsFINAL assume true; 144033#partsEXIT >#66#return; 144032#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144030#partsFINAL assume true; 144028#partsEXIT >#64#return; 144025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144026#$Ultimate##0 ~p := #in~p;~q := #in~q; 144031#L20 assume !(~p <= 0); 144029#L21 assume ~q <= 0;#res := 0; 144027#partsFINAL assume true; 144024#partsEXIT >#66#return; 144023#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144022#partsFINAL assume true; 144021#partsEXIT >#66#return; 144019#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144017#partsFINAL assume true; 144014#partsEXIT >#62#return; 143113#L22-2 #res := #t~ret0;havoc #t~ret0; 143116#partsFINAL assume true; 143709#partsEXIT >#68#return; 143133#L36-1 havoc main_#t~ret8#1; 143129#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143128#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 143070#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 143071#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 143176#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143590#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143627#$Ultimate##0 ~p := #in~p;~q := #in~q; 143619#L20 assume !(~p <= 0); 143618#L21 assume ~q <= 0;#res := 0; 143589#partsFINAL assume true; 143591#partsEXIT >#68#return; 143121#L36-1 havoc main_#t~ret8#1; 143122#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143074#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143075#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143626#$Ultimate##0 ~p := #in~p;~q := #in~q; 143697#L20 assume !(~p <= 0); 143694#L21 assume !(~q <= 0); 143690#L22 assume !(~q > ~p); 143650#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143655#$Ultimate##0 ~p := #in~p;~q := #in~q; 143693#L20 assume !(~p <= 0); 143689#L21 assume !(~q <= 0); 143688#L22 assume !(~q > ~p); 143665#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143668#$Ultimate##0 ~p := #in~p;~q := #in~q; 143676#L20 assume !(~p <= 0); 143675#L21 assume !(~q <= 0); 143673#L22 assume !(~q > ~p); 143674#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143704#$Ultimate##0 ~p := #in~p;~q := #in~q; 143801#L20 assume ~p <= 0;#res := 1; 143706#partsFINAL assume true; 143703#partsEXIT >#64#return; 143700#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143701#$Ultimate##0 ~p := #in~p;~q := #in~q; 143707#L20 assume !(~p <= 0); 143705#L21 assume ~q <= 0;#res := 0; 143702#partsFINAL assume true; 143699#partsEXIT >#66#return; 143696#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143692#partsFINAL assume true; 143687#partsEXIT >#64#return; 143678#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143681#$Ultimate##0 ~p := #in~p;~q := #in~q; 143698#L20 assume !(~p <= 0); 143695#L21 assume ~q <= 0;#res := 0; 143691#partsFINAL assume true; 143677#partsEXIT >#66#return; 143680#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143683#partsFINAL assume true; 143654#partsEXIT >#64#return; 143643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143645#$Ultimate##0 ~p := #in~p;~q := #in~q; 143656#L20 assume !(~p <= 0); 143653#L21 assume ~q <= 0;#res := 0; 143647#partsFINAL assume true; 143641#partsEXIT >#66#return; 143644#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143708#partsFINAL assume true; 143625#partsEXIT >#68#return; 143624#L36-1 havoc main_#t~ret8#1; 143111#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143112#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143060#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143061#$Ultimate##0 ~p := #in~p;~q := #in~q; 143780#L20 assume !(~p <= 0); 143775#L21 assume !(~q <= 0); 143770#L22 assume !(~q > ~p); 143762#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143765#$Ultimate##0 ~p := #in~p;~q := #in~q; 143788#L20 assume !(~p <= 0); 143784#L21 assume !(~q <= 0); 143782#L22 assume ~q > ~p; 143778#L22-1 call #t~ret0 := parts(~p, ~p);< 143779#$Ultimate##0 ~p := #in~p;~q := #in~q; 143799#L20 assume !(~p <= 0); 143798#L21 assume !(~q <= 0); 143795#L22 assume !(~q > ~p); 143791#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143792#$Ultimate##0 ~p := #in~p;~q := #in~q; 143797#L20 assume ~p <= 0;#res := 1; 143794#partsFINAL assume true; 143790#partsEXIT >#64#return; 143786#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143787#$Ultimate##0 ~p := #in~p;~q := #in~q; 143796#L20 assume !(~p <= 0); 143793#L21 assume ~q <= 0;#res := 0; 143789#partsFINAL assume true; 143785#partsEXIT >#66#return; 143783#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143781#partsFINAL assume true; 143777#partsEXIT >#62#return; 143774#L22-2 #res := #t~ret0;havoc #t~ret0; 143769#partsFINAL assume true; 143761#partsEXIT >#64#return; 143751#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143757#$Ultimate##0 ~p := #in~p;~q := #in~q; 144072#L20 assume !(~p <= 0); 144010#L21 assume !(~q <= 0); 144011#L22 assume !(~q > ~p); 143861#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143865#$Ultimate##0 ~p := #in~p;~q := #in~q; 143889#L20 assume !(~p <= 0); 143885#L21 assume !(~q <= 0); 143883#L22 assume !(~q > ~p); 143878#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143880#$Ultimate##0 ~p := #in~p;~q := #in~q; 143890#L20 assume !(~p <= 0); 143887#L21 assume !(~q <= 0); 143888#L22 assume !(~q > ~p); 143906#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143908#$Ultimate##0 ~p := #in~p;~q := #in~q; 143915#L20 assume ~p <= 0;#res := 1; 143911#partsFINAL assume true; 143905#partsEXIT >#64#return; 143899#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143901#$Ultimate##0 ~p := #in~p;~q := #in~q; 143925#L20 assume !(~p <= 0); 143921#L21 assume ~q <= 0;#res := 0; 143909#partsFINAL assume true; 143897#partsEXIT >#66#return; 143896#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143882#partsFINAL assume true; 143879#partsEXIT >#64#return; 143871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143874#$Ultimate##0 ~p := #in~p;~q := #in~q; 143892#L20 assume !(~p <= 0); 143881#L21 assume ~q <= 0;#res := 0; 143876#partsFINAL assume true; 143870#partsEXIT >#66#return; 143868#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143866#partsFINAL assume true; 143859#partsEXIT >#64#return; 143864#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144083#$Ultimate##0 ~p := #in~p;~q := #in~q; 144088#L20 assume !(~p <= 0); 144086#L21 assume ~q <= 0;#res := 0; 144084#partsFINAL assume true; 144082#partsEXIT >#66#return; 143754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144080#partsFINAL assume true; 143747#partsEXIT >#66#return; 143745#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143710#partsFINAL assume true; 143621#partsEXIT >#68#return; 143623#L36-1 havoc main_#t~ret8#1; 143714#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143713#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143622#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143061#$Ultimate##0 ~p := #in~p;~q := #in~q; 143780#L20 assume !(~p <= 0); 143775#L21 assume !(~q <= 0); 143770#L22 assume !(~q > ~p); 143772#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143833#$Ultimate##0 ~p := #in~p;~q := #in~q; 143852#L20 assume ~p <= 0;#res := 1; 143843#partsFINAL assume true; 143831#partsEXIT >#64#return; 143080#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143821#$Ultimate##0 ~p := #in~p;~q := #in~q; 144079#L20 assume !(~p <= 0); 144078#L21 assume !(~q <= 0); 143079#L22 assume !(~q > ~p); 143082#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143959#$Ultimate##0 ~p := #in~p;~q := #in~q; 143957#L20 assume !(~p <= 0); 143955#L21 assume !(~q <= 0); 143954#L22 assume ~q > ~p; 143068#L22-1 call #t~ret0 := parts(~p, ~p);< 143107#$Ultimate##0 ~p := #in~p;~q := #in~q; 144020#L20 assume !(~p <= 0); 144018#L21 assume !(~q <= 0); 144016#L22 assume !(~q > ~p); 143067#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143069#$Ultimate##0 ~p := #in~p;~q := #in~q; 144000#L20 assume ~p <= 0;#res := 1; 143998#partsFINAL assume true; 143996#partsEXIT >#64#return; 143993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143994#$Ultimate##0 ~p := #in~p;~q := #in~q; 143999#L20 assume !(~p <= 0); 143997#L21 assume ~q <= 0;#res := 0; 143995#partsFINAL assume true; 143992#partsEXIT >#66#return; 143991#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143990#partsFINAL assume true; 143989#partsEXIT >#62#return; 143988#L22-2 #res := #t~ret0;havoc #t~ret0; 143987#partsFINAL assume true; 143986#partsEXIT >#64#return; 143750#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143757#$Ultimate##0 ~p := #in~p;~q := #in~q; 144072#L20 assume !(~p <= 0); 144010#L21 assume !(~q <= 0); 144011#L22 assume !(~q > ~p); 143861#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143865#$Ultimate##0 ~p := #in~p;~q := #in~q; 143889#L20 assume !(~p <= 0); 143885#L21 assume !(~q <= 0); 143883#L22 assume !(~q > ~p); 143878#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143880#$Ultimate##0 ~p := #in~p;~q := #in~q; 143890#L20 assume !(~p <= 0); 143887#L21 assume !(~q <= 0); 143888#L22 assume !(~q > ~p); 143906#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143908#$Ultimate##0 ~p := #in~p;~q := #in~q; 143915#L20 assume ~p <= 0;#res := 1; 143911#partsFINAL assume true; 143905#partsEXIT >#64#return; 143899#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143901#$Ultimate##0 ~p := #in~p;~q := #in~q; 143925#L20 assume !(~p <= 0); 143921#L21 assume ~q <= 0;#res := 0; 143909#partsFINAL assume true; 143897#partsEXIT >#66#return; 143896#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143882#partsFINAL assume true; 143879#partsEXIT >#64#return; 143871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143874#$Ultimate##0 ~p := #in~p;~q := #in~q; 143892#L20 assume !(~p <= 0); 143881#L21 assume ~q <= 0;#res := 0; 143876#partsFINAL assume true; 143870#partsEXIT >#66#return; 143868#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143866#partsFINAL assume true; 143859#partsEXIT >#64#return; 143864#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144083#$Ultimate##0 ~p := #in~p;~q := #in~q; 144088#L20 assume !(~p <= 0); 144086#L21 assume ~q <= 0;#res := 0; 144084#partsFINAL assume true; 144082#partsEXIT >#66#return; 143754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144080#partsFINAL assume true; 143747#partsEXIT >#66#return; 143756#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143931#partsFINAL assume true; 143818#partsEXIT >#66#return; 143820#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143929#partsFINAL assume true; 143725#partsEXIT >#68#return; 143723#L36-1 havoc main_#t~ret8#1; 143721#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143719#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143100#L36 [2023-02-15 23:15:19,690 INFO L750 eck$LassoCheckResult]: Loop: 143100#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 143061#$Ultimate##0 ~p := #in~p;~q := #in~q; 143780#L20 assume !(~p <= 0); 143775#L21 assume !(~q <= 0); 143770#L22 assume !(~q > ~p); 143772#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143833#$Ultimate##0 ~p := #in~p;~q := #in~q; 143852#L20 assume ~p <= 0;#res := 1; 143843#partsFINAL assume true; 143831#partsEXIT >#64#return; 143080#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143821#$Ultimate##0 ~p := #in~p;~q := #in~q; 144079#L20 assume !(~p <= 0); 144078#L21 assume !(~q <= 0); 143079#L22 assume !(~q > ~p); 143082#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143959#$Ultimate##0 ~p := #in~p;~q := #in~q; 143957#L20 assume !(~p <= 0); 143955#L21 assume !(~q <= 0); 143954#L22 assume ~q > ~p; 143068#L22-1 call #t~ret0 := parts(~p, ~p);< 143107#$Ultimate##0 ~p := #in~p;~q := #in~q; 144020#L20 assume !(~p <= 0); 144018#L21 assume !(~q <= 0); 144016#L22 assume !(~q > ~p); 143067#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143069#$Ultimate##0 ~p := #in~p;~q := #in~q; 144000#L20 assume ~p <= 0;#res := 1; 143998#partsFINAL assume true; 143996#partsEXIT >#64#return; 143993#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143994#$Ultimate##0 ~p := #in~p;~q := #in~q; 143999#L20 assume !(~p <= 0); 143997#L21 assume ~q <= 0;#res := 0; 143995#partsFINAL assume true; 143992#partsEXIT >#66#return; 143991#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143990#partsFINAL assume true; 143989#partsEXIT >#62#return; 143988#L22-2 #res := #t~ret0;havoc #t~ret0; 143987#partsFINAL assume true; 143986#partsEXIT >#64#return; 143750#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143757#$Ultimate##0 ~p := #in~p;~q := #in~q; 144072#L20 assume !(~p <= 0); 144010#L21 assume !(~q <= 0); 144011#L22 assume !(~q > ~p); 143861#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143865#$Ultimate##0 ~p := #in~p;~q := #in~q; 143889#L20 assume !(~p <= 0); 143885#L21 assume !(~q <= 0); 143883#L22 assume !(~q > ~p); 143878#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143880#$Ultimate##0 ~p := #in~p;~q := #in~q; 143890#L20 assume !(~p <= 0); 143887#L21 assume !(~q <= 0); 143888#L22 assume !(~q > ~p); 143906#L23 call #t~ret1 := parts(~p - ~q, ~q);< 143908#$Ultimate##0 ~p := #in~p;~q := #in~q; 143915#L20 assume ~p <= 0;#res := 1; 143911#partsFINAL assume true; 143905#partsEXIT >#64#return; 143899#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143901#$Ultimate##0 ~p := #in~p;~q := #in~q; 143925#L20 assume !(~p <= 0); 143921#L21 assume ~q <= 0;#res := 0; 143909#partsFINAL assume true; 143897#partsEXIT >#66#return; 143896#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143882#partsFINAL assume true; 143879#partsEXIT >#64#return; 143871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 143874#$Ultimate##0 ~p := #in~p;~q := #in~q; 143892#L20 assume !(~p <= 0); 143881#L21 assume ~q <= 0;#res := 0; 143876#partsFINAL assume true; 143870#partsEXIT >#66#return; 143868#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143866#partsFINAL assume true; 143859#partsEXIT >#64#return; 143864#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 144083#$Ultimate##0 ~p := #in~p;~q := #in~q; 144088#L20 assume !(~p <= 0); 144086#L21 assume ~q <= 0;#res := 0; 144084#partsFINAL assume true; 144082#partsEXIT >#66#return; 143754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 144080#partsFINAL assume true; 143747#partsEXIT >#66#return; 143756#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143931#partsFINAL assume true; 143818#partsEXIT >#66#return; 143820#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 143929#partsFINAL assume true; 143725#partsEXIT >#68#return; 143723#L36-1 havoc main_#t~ret8#1; 143721#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 143719#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 143100#L36 [2023-02-15 23:15:19,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1281027642, now seen corresponding path program 9 times [2023-02-15 23:15:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:19,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263434946] [2023-02-15 23:15:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:15:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 23:15:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-15 23:15:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-15 23:15:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 23:15:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-02-15 23:15:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-02-15 23:15:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-02-15 23:15:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-02-15 23:15:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:19,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2023-02-15 23:15:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-02-15 23:15:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-02-15 23:15:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2023-02-15 23:15:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13232 backedges. 31 proven. 393 refuted. 0 times theorem prover too weak. 12808 trivial. 0 not checked. [2023-02-15 23:15:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263434946] [2023-02-15 23:15:20,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263434946] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096584712] [2023-02-15 23:15:20,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:15:20,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:20,100 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:20,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2023-02-15 23:15:20,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-15 23:15:20,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:20,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 23:15:20,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13232 backedges. 1524 proven. 1507 refuted. 0 times theorem prover too weak. 10201 trivial. 0 not checked. [2023-02-15 23:15:20,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13232 backedges. 1520 proven. 1527 refuted. 0 times theorem prover too weak. 10185 trivial. 0 not checked. [2023-02-15 23:15:21,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096584712] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:21,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:21,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 25] total 43 [2023-02-15 23:15:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760497651] [2023-02-15 23:15:21,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:21,412 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:15:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2000301945, now seen corresponding path program 1 times [2023-02-15 23:15:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78716347] [2023-02-15 23:15:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:21,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:21,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:22,030 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:22,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:22,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:22,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:22,030 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:15:22,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:22,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:22,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2023-02-15 23:15:22,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:22,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:22,031 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,037 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,050 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:22,050 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:15:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,053 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-02-15 23:15:22,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:22,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:22,075 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:22,075 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:22,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,081 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-02-15 23:15:22,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:22,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:22,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,110 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-02-15 23:15:22,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:15:22,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:22,135 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:15:22,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,139 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:22,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:22,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:22,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:22,139 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:15:22,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:22,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:22,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration24_Loop [2023-02-15 23:15:22,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:22,139 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:22,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,145 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:22,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:22,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:15:22,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,185 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2023-02-15 23:15:22,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:22,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:22,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:22,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:22,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:22,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:22,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:22,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:22,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:22,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,207 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-02-15 23:15:22,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:22,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:22,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:22,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:22,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:22,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:22,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:22,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:22,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:22,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:22,235 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:15:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:22,238 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:22,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-02-15 23:15:22,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:22,240 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:22,240 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:22,240 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 7 Supporting invariants [] [2023-02-15 23:15:22,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,244 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:22,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:22,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 144 conjunts are in the unsatisfiable core [2023-02-15 23:15:22,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:24,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 23:15:24,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-02-15 23:15:24,969 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2023-02-15 23:15:24,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151 Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:25,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151. Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 1122 states and 1258 transitions. Complement of second has 17 states. [2023-02-15 23:15:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2023-02-15 23:15:25,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 531 letters. Loop has 98 letters. [2023-02-15 23:15:25,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:25,037 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:25,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 144 conjunts are in the unsatisfiable core [2023-02-15 23:15:25,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:27,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 23:15:27,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-02-15 23:15:28,020 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 15 loop predicates [2023-02-15 23:15:28,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151 Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:28,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151. Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 1122 states and 1258 transitions. Complement of second has 17 states. [2023-02-15 23:15:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2023-02-15 23:15:28,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 531 letters. Loop has 98 letters. [2023-02-15 23:15:28,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:28,101 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:28,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 144 conjunts are in the unsatisfiable core [2023-02-15 23:15:28,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:30,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 23:15:30,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 125 proven. 157 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-02-15 23:15:30,940 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2023-02-15 23:15:30,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151 Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:31,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1089 states and 1223 transitions. cyclomatic complexity: 151. Second operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Result 2621 states and 3108 transitions. Complement of second has 105 states. [2023-02-15 23:15:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 10 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 23:15:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 104 transitions. [2023-02-15 23:15:31,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 104 transitions. Stem has 531 letters. Loop has 98 letters. [2023-02-15 23:15:31,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:31,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 104 transitions. Stem has 629 letters. Loop has 98 letters. [2023-02-15 23:15:31,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:31,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 104 transitions. Stem has 531 letters. Loop has 196 letters. [2023-02-15 23:15:31,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:31,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2621 states and 3108 transitions. [2023-02-15 23:15:31,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2023-02-15 23:15:31,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2621 states to 1868 states and 2231 transitions. [2023-02-15 23:15:31,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2023-02-15 23:15:31,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2023-02-15 23:15:31,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1868 states and 2231 transitions. [2023-02-15 23:15:31,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:31,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1868 states and 2231 transitions. [2023-02-15 23:15:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states and 2231 transitions. [2023-02-15 23:15:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1709. [2023-02-15 23:15:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1180 states have (on average 1.047457627118644) internal successors, (1236), 1208 states have internal predecessors, (1236), 292 states have call successors, (300), 195 states have call predecessors, (300), 237 states have return successors, (398), 305 states have call predecessors, (398), 292 states have call successors, (398) [2023-02-15 23:15:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 1934 transitions. [2023-02-15 23:15:31,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1709 states and 1934 transitions. [2023-02-15 23:15:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 23:15:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 23:15:31,430 INFO L87 Difference]: Start difference. First operand 1709 states and 1934 transitions. Second operand has 44 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 44 states have internal predecessors, (133), 24 states have call successors, (35), 1 states have call predecessors, (35), 8 states have return successors, (41), 25 states have call predecessors, (41), 24 states have call successors, (41) [2023-02-15 23:15:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:33,413 INFO L93 Difference]: Finished difference Result 2934 states and 3678 transitions. [2023-02-15 23:15:33,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2934 states and 3678 transitions. [2023-02-15 23:15:33,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2023-02-15 23:15:33,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2934 states to 2575 states and 3237 transitions. [2023-02-15 23:15:33,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2023-02-15 23:15:33,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2023-02-15 23:15:33,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2575 states and 3237 transitions. [2023-02-15 23:15:33,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:33,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2575 states and 3237 transitions. [2023-02-15 23:15:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states and 3237 transitions. [2023-02-15 23:15:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 1896. [2023-02-15 23:15:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1314 states have (on average 1.04337899543379) internal successors, (1371), 1343 states have internal predecessors, (1371), 324 states have call successors, (332), 218 states have call predecessors, (332), 258 states have return successors, (471), 334 states have call predecessors, (471), 324 states have call successors, (471) [2023-02-15 23:15:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2174 transitions. [2023-02-15 23:15:33,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1896 states and 2174 transitions. [2023-02-15 23:15:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-02-15 23:15:33,459 INFO L428 stractBuchiCegarLoop]: Abstraction has 1896 states and 2174 transitions. [2023-02-15 23:15:33,459 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-02-15 23:15:33,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1896 states and 2174 transitions. [2023-02-15 23:15:33,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2023-02-15 23:15:33,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:33,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:33,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [84, 84, 62, 36, 29, 29, 29, 29, 29, 29, 26, 22, 20, 19, 19, 19, 19, 7, 7, 7, 7, 4, 3, 3, 1, 1, 1, 1] [2023-02-15 23:15:33,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 23:15:33,466 INFO L748 eck$LassoCheckResult]: Stem: 164160#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 164125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 164126#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 164120#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 164121#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 164177#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164366#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164367#$Ultimate##0 ~p := #in~p;~q := #in~q; 164369#L20 assume ~p <= 0;#res := 1; 164368#partsFINAL assume true; 164365#partsEXIT >#68#return; 164364#L36-1 havoc main_#t~ret8#1; 164363#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164361#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164358#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164359#$Ultimate##0 ~p := #in~p;~q := #in~q; 164362#L20 assume ~p <= 0;#res := 1; 164360#partsFINAL assume true; 164357#partsEXIT >#68#return; 164356#L36-1 havoc main_#t~ret8#1; 164355#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164353#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164350#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164351#$Ultimate##0 ~p := #in~p;~q := #in~q; 164354#L20 assume ~p <= 0;#res := 1; 164352#partsFINAL assume true; 164349#partsEXIT >#68#return; 164348#L36-1 havoc main_#t~ret8#1; 164347#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164345#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164343#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164338#$Ultimate##0 ~p := #in~p;~q := #in~q; 164346#L20 assume ~p <= 0;#res := 1; 164344#partsFINAL assume true; 164342#partsEXIT >#68#return; 164341#L36-1 havoc main_#t~ret8#1; 164340#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164339#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164149#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164148#$Ultimate##0 ~p := #in~p;~q := #in~q; 164150#L20 assume ~p <= 0;#res := 1; 164797#partsFINAL assume true; 164796#partsEXIT >#68#return; 164794#L36-1 havoc main_#t~ret8#1; 164180#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164179#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 164135#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 164136#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 164178#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164973#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164974#$Ultimate##0 ~p := #in~p;~q := #in~q; 164984#L20 assume !(~p <= 0); 164982#L21 assume ~q <= 0;#res := 0; 164980#partsFINAL assume true; 164972#partsEXIT >#68#return; 164967#L36-1 havoc main_#t~ret8#1; 164963#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164961#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164958#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164959#$Ultimate##0 ~p := #in~p;~q := #in~q; 164983#L20 assume !(~p <= 0); 164981#L21 assume !(~q <= 0); 164979#L22 assume !(~q > ~p); 164970#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164971#$Ultimate##0 ~p := #in~p;~q := #in~q; 164978#L20 assume ~p <= 0;#res := 1; 164977#partsFINAL assume true; 164969#partsEXIT >#64#return; 164965#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164966#$Ultimate##0 ~p := #in~p;~q := #in~q; 164976#L20 assume !(~p <= 0); 164975#L21 assume ~q <= 0;#res := 0; 164968#partsFINAL assume true; 164964#partsEXIT >#66#return; 164962#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164960#partsFINAL assume true; 164957#partsEXIT >#68#return; 164955#L36-1 havoc main_#t~ret8#1; 164952#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164947#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164938#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164941#$Ultimate##0 ~p := #in~p;~q := #in~q; 164954#L20 assume !(~p <= 0); 164951#L21 assume !(~q <= 0); 164943#L22 assume ~q > ~p; 164932#L22-1 call #t~ret0 := parts(~p, ~p);< 164935#$Ultimate##0 ~p := #in~p;~q := #in~q; 164993#L20 assume !(~p <= 0); 164992#L21 assume !(~q <= 0); 164990#L22 assume !(~q > ~p); 164986#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164987#$Ultimate##0 ~p := #in~p;~q := #in~q; 164991#L20 assume ~p <= 0;#res := 1; 164989#partsFINAL assume true; 164985#partsEXIT >#64#return; 164949#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164950#$Ultimate##0 ~p := #in~p;~q := #in~q; 164988#L20 assume !(~p <= 0); 164956#L21 assume ~q <= 0;#res := 0; 164953#partsFINAL assume true; 164948#partsEXIT >#66#return; 164942#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164937#partsFINAL assume true; 164931#partsEXIT >#62#return; 164934#L22-2 #res := #t~ret0;havoc #t~ret0; 164945#partsFINAL assume true; 164940#partsEXIT >#68#return; 164936#L36-1 havoc main_#t~ret8#1; 164930#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164928#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164926#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164768#$Ultimate##0 ~p := #in~p;~q := #in~q; 164946#L20 assume !(~p <= 0); 164944#L21 assume !(~q <= 0); 164939#L22 assume ~q > ~p; 164933#L22-1 call #t~ret0 := parts(~p, ~p);< 164935#$Ultimate##0 ~p := #in~p;~q := #in~q; 164993#L20 assume !(~p <= 0); 164992#L21 assume !(~q <= 0); 164990#L22 assume !(~q > ~p); 164986#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164987#$Ultimate##0 ~p := #in~p;~q := #in~q; 164991#L20 assume ~p <= 0;#res := 1; 164989#partsFINAL assume true; 164985#partsEXIT >#64#return; 164949#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164950#$Ultimate##0 ~p := #in~p;~q := #in~q; 164988#L20 assume !(~p <= 0); 164956#L21 assume ~q <= 0;#res := 0; 164953#partsFINAL assume true; 164948#partsEXIT >#66#return; 164942#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164937#partsFINAL assume true; 164931#partsEXIT >#62#return; 164929#L22-2 #res := #t~ret0;havoc #t~ret0; 164927#partsFINAL assume true; 164925#partsEXIT >#68#return; 164909#L36-1 havoc main_#t~ret8#1; 164799#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164795#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164767#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164769#$Ultimate##0 ~p := #in~p;~q := #in~q; 164782#L20 assume !(~p <= 0); 164778#L21 assume !(~q <= 0); 164776#L22 assume ~q > ~p; 164773#L22-1 call #t~ret0 := parts(~p, ~p);< 164774#$Ultimate##0 ~p := #in~p;~q := #in~q; 164793#L20 assume !(~p <= 0); 164792#L21 assume !(~q <= 0); 164789#L22 assume !(~q > ~p); 164785#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164786#$Ultimate##0 ~p := #in~p;~q := #in~q; 164791#L20 assume ~p <= 0;#res := 1; 164788#partsFINAL assume true; 164784#partsEXIT >#64#return; 164780#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164781#$Ultimate##0 ~p := #in~p;~q := #in~q; 164790#L20 assume !(~p <= 0); 164787#L21 assume ~q <= 0;#res := 0; 164783#partsFINAL assume true; 164779#partsEXIT >#66#return; 164777#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164775#partsFINAL assume true; 164772#partsEXIT >#62#return; 164771#L22-2 #res := #t~ret0;havoc #t~ret0; 164770#partsFINAL assume true; 164766#partsEXIT >#68#return; 164761#L36-1 havoc main_#t~ret8#1; 164749#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164748#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 164746#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 164744#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 164742#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164725#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164726#$Ultimate##0 ~p := #in~p;~q := #in~q; 164755#L20 assume !(~p <= 0); 164753#L21 assume ~q <= 0;#res := 0; 164741#partsFINAL assume true; 164723#partsEXIT >#68#return; 164721#L36-1 havoc main_#t~ret8#1; 164715#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164710#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164703#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164706#$Ultimate##0 ~p := #in~p;~q := #in~q; 164728#L20 assume !(~p <= 0); 164727#L21 assume !(~q <= 0); 164722#L22 assume !(~q > ~p); 164719#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164720#$Ultimate##0 ~p := #in~p;~q := #in~q; 164757#L20 assume !(~p <= 0); 164756#L21 assume !(~q <= 0); 164754#L22 assume !(~q > ~p); 164751#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164752#$Ultimate##0 ~p := #in~p;~q := #in~q; 164759#L20 assume ~p <= 0;#res := 1; 164758#partsFINAL assume true; 164750#partsEXIT >#64#return; 164738#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164739#$Ultimate##0 ~p := #in~p;~q := #in~q; 164747#L20 assume !(~p <= 0); 164745#L21 assume ~q <= 0;#res := 0; 164743#partsFINAL assume true; 164737#partsEXIT >#66#return; 164735#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164733#partsFINAL assume true; 164718#partsEXIT >#64#return; 164713#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164714#$Ultimate##0 ~p := #in~p;~q := #in~q; 164730#L20 assume !(~p <= 0); 164729#L21 assume ~q <= 0;#res := 0; 164717#partsFINAL assume true; 164712#partsEXIT >#66#return; 164709#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164707#partsFINAL assume true; 164702#partsEXIT >#68#return; 164705#L36-1 havoc main_#t~ret8#1; 164764#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164760#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164403#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164405#$Ultimate##0 ~p := #in~p;~q := #in~q; 164924#L20 assume !(~p <= 0); 164923#L21 assume !(~q <= 0); 164921#L22 assume !(~q > ~p); 164914#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164918#$Ultimate##0 ~p := #in~p;~q := #in~q; 164919#L20 assume ~p <= 0;#res := 1; 164913#partsFINAL assume true; 164915#partsEXIT >#64#return; 164415#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164416#$Ultimate##0 ~p := #in~p;~q := #in~q; 165215#L20 assume !(~p <= 0); 165214#L21 assume !(~q <= 0); 164589#L22 assume !(~q > ~p); 164441#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164444#$Ultimate##0 ~p := #in~p;~q := #in~q; 164508#L20 assume !(~p <= 0); 164505#L21 assume !(~q <= 0); 164504#L22 assume !(~q > ~p); 164502#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164503#$Ultimate##0 ~p := #in~p;~q := #in~q; 164552#L20 assume ~p <= 0;#res := 1; 164507#partsFINAL assume true; 164500#partsEXIT >#64#return; 164457#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164459#$Ultimate##0 ~p := #in~p;~q := #in~q; 164562#L20 assume !(~p <= 0); 164463#L21 assume ~q <= 0;#res := 0; 164460#partsFINAL assume true; 164455#partsEXIT >#66#return; 164454#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164447#partsFINAL assume true; 164438#partsEXIT >#64#return; 164431#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164434#$Ultimate##0 ~p := #in~p;~q := #in~q; 164453#L20 assume !(~p <= 0); 164446#L21 assume ~q <= 0;#res := 0; 164436#partsFINAL assume true; 164430#partsEXIT >#66#return; 164422#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164418#partsFINAL assume true; 164413#partsEXIT >#66#return; 164411#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164407#partsFINAL assume true; 164400#partsEXIT >#68#return; 164398#L36-1 havoc main_#t~ret8#1; 164394#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164391#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164388#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164305#$Ultimate##0 ~p := #in~p;~q := #in~q; 164580#L20 assume !(~p <= 0); 164579#L21 assume !(~q <= 0); 164574#L22 assume ~q > ~p; 164396#L22-1 call #t~ret0 := parts(~p, ~p);< 164397#$Ultimate##0 ~p := #in~p;~q := #in~q; 164588#L20 assume !(~p <= 0); 164587#L21 assume !(~q <= 0); 164586#L22 assume !(~q > ~p); 164582#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164583#$Ultimate##0 ~p := #in~p;~q := #in~q; 164585#L20 assume ~p <= 0;#res := 1; 164584#partsFINAL assume true; 164581#partsEXIT >#64#return; 164409#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164410#$Ultimate##0 ~p := #in~p;~q := #in~q; 164493#L20 assume !(~p <= 0); 164491#L21 assume !(~q <= 0); 164488#L22 assume !(~q > ~p); 164425#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164429#$Ultimate##0 ~p := #in~p;~q := #in~q; 164526#L20 assume !(~p <= 0); 164524#L21 assume !(~q <= 0); 164522#L22 assume !(~q > ~p); 164482#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164483#$Ultimate##0 ~p := #in~p;~q := #in~q; 164548#L20 assume ~p <= 0;#res := 1; 164546#partsFINAL assume true; 164480#partsEXIT >#64#return; 164472#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164475#$Ultimate##0 ~p := #in~p;~q := #in~q; 164484#L20 assume !(~p <= 0); 164479#L21 assume ~q <= 0;#res := 0; 164476#partsFINAL assume true; 164471#partsEXIT >#66#return; 164470#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164464#partsFINAL assume true; 164424#partsEXIT >#64#return; 164420#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164421#$Ultimate##0 ~p := #in~p;~q := #in~q; 164445#L20 assume !(~p <= 0); 164435#L21 assume ~q <= 0;#res := 0; 164423#partsFINAL assume true; 164419#partsEXIT >#66#return; 164417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164412#partsFINAL assume true; 164408#partsEXIT >#66#return; 164406#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164399#partsFINAL assume true; 164395#partsEXIT >#62#return; 164393#L22-2 #res := #t~ret0;havoc #t~ret0; 164390#partsFINAL assume true; 164387#partsEXIT >#68#return; 164385#L36-1 havoc main_#t~ret8#1; 164380#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164379#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164167#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164304#$Ultimate##0 ~p := #in~p;~q := #in~q; 164303#L20 assume !(~p <= 0); 164302#L21 assume !(~q <= 0); 164301#L22 assume ~q > ~p; 164182#L22-1 call #t~ret0 := parts(~p, ~p);< 164225#$Ultimate##0 ~p := #in~p;~q := #in~q; 164226#L20 assume !(~p <= 0); 164219#L21 assume !(~q <= 0); 164220#L22 assume !(~q > ~p); 164195#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164196#$Ultimate##0 ~p := #in~p;~q := #in~q; 164205#L20 assume ~p <= 0;#res := 1; 164206#partsFINAL assume true; 164194#partsEXIT >#64#return; 164189#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164300#$Ultimate##0 ~p := #in~p;~q := #in~q; 164298#L20 assume !(~p <= 0); 164296#L21 assume !(~q <= 0); 164294#L22 assume !(~q > ~p); 164201#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164238#$Ultimate##0 ~p := #in~p;~q := #in~q; 164211#L20 assume !(~p <= 0); 164207#L21 assume !(~q <= 0); 164200#L22 assume !(~q > ~p); 164204#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164130#$Ultimate##0 ~p := #in~p;~q := #in~q; 164290#L20 assume ~p <= 0;#res := 1; 164262#partsFINAL assume true; 164252#partsEXIT >#64#return; 164247#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164249#$Ultimate##0 ~p := #in~p;~q := #in~q; 164255#L20 assume !(~p <= 0); 164254#L21 assume ~q <= 0;#res := 0; 164251#partsFINAL assume true; 164246#partsEXIT >#66#return; 164244#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164240#partsFINAL assume true; 164237#partsEXIT >#64#return; 164230#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164233#$Ultimate##0 ~p := #in~p;~q := #in~q; 164243#L20 assume !(~p <= 0); 164239#L21 assume ~q <= 0;#res := 0; 164236#partsFINAL assume true; 164229#partsEXIT >#66#return; 164231#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165380#partsFINAL assume true; 165379#partsEXIT >#66#return; 164186#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164187#partsFINAL assume true; 164181#partsEXIT >#62#return; 164183#L22-2 #res := #t~ret0;havoc #t~ret0; 164221#partsFINAL assume true; 164222#partsEXIT >#68#return; 164371#L36-1 havoc main_#t~ret8#1; 164161#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164162#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 164133#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 164134#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 164142#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164143#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164854#$Ultimate##0 ~p := #in~p;~q := #in~q; 164842#L20 assume !(~p <= 0); 164834#L21 assume ~q <= 0;#res := 0; 164828#partsFINAL assume true; 164829#partsEXIT >#68#return; 164818#L36-1 havoc main_#t~ret8#1; 164809#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164806#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164802#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164853#$Ultimate##0 ~p := #in~p;~q := #in~q; 164841#L20 assume !(~p <= 0); 164832#L21 assume !(~q <= 0); 164833#L22 assume !(~q > ~p); 164820#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165635#$Ultimate##0 ~p := #in~p;~q := #in~q; 165652#L20 assume !(~p <= 0); 165651#L21 assume !(~q <= 0); 165650#L22 assume !(~q > ~p); 164847#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164852#$Ultimate##0 ~p := #in~p;~q := #in~q; 164860#L20 assume !(~p <= 0); 164859#L21 assume !(~q <= 0); 164857#L22 assume !(~q > ~p); 164858#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164868#$Ultimate##0 ~p := #in~p;~q := #in~q; 164872#L20 assume ~p <= 0;#res := 1; 164870#partsFINAL assume true; 164867#partsEXIT >#64#return; 164863#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164865#$Ultimate##0 ~p := #in~p;~q := #in~q; 164871#L20 assume !(~p <= 0); 164869#L21 assume ~q <= 0;#res := 0; 164866#partsFINAL assume true; 164862#partsEXIT >#66#return; 164864#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165649#partsFINAL assume true; 165648#partsEXIT >#64#return; 164836#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164840#$Ultimate##0 ~p := #in~p;~q := #in~q; 165654#L20 assume !(~p <= 0); 165653#L21 assume ~q <= 0;#res := 0; 165647#partsFINAL assume true; 164835#partsEXIT >#66#return; 164838#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164825#partsFINAL assume true; 164826#partsEXIT >#64#return; 164811#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164814#$Ultimate##0 ~p := #in~p;~q := #in~q; 164817#L20 assume !(~p <= 0); 164816#L21 assume ~q <= 0;#res := 0; 164815#partsFINAL assume true; 164810#partsEXIT >#66#return; 164807#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164808#partsFINAL assume true; 165617#partsEXIT >#68#return; 165606#L36-1 havoc main_#t~ret8#1; 165605#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 165603#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 165604#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 165724#$Ultimate##0 ~p := #in~p;~q := #in~q; 165776#L20 assume !(~p <= 0); 165775#L21 assume !(~q <= 0); 165774#L22 assume !(~q > ~p); 165731#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165762#$Ultimate##0 ~p := #in~p;~q := #in~q; 165763#L20 assume !(~p <= 0); 165755#L21 assume !(~q <= 0); 165756#L22 assume ~q > ~p; 165739#L22-1 call #t~ret0 := parts(~p, ~p);< 165742#$Ultimate##0 ~p := #in~p;~q := #in~q; 165766#L20 assume !(~p <= 0); 165764#L21 assume !(~q <= 0); 165761#L22 assume !(~q > ~p); 165752#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165753#$Ultimate##0 ~p := #in~p;~q := #in~q; 165760#L20 assume ~p <= 0;#res := 1; 165757#partsFINAL assume true; 165751#partsEXIT >#64#return; 165746#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165747#$Ultimate##0 ~p := #in~p;~q := #in~q; 165754#L20 assume !(~p <= 0); 165749#L21 assume ~q <= 0;#res := 0; 165748#partsFINAL assume true; 165745#partsEXIT >#66#return; 165744#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165743#partsFINAL assume true; 165738#partsEXIT >#62#return; 165735#L22-2 #res := #t~ret0;havoc #t~ret0; 165730#partsFINAL assume true; 165732#partsEXIT >#64#return; 165612#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165726#$Ultimate##0 ~p := #in~p;~q := #in~q; 165767#L20 assume !(~p <= 0); 165768#L21 assume !(~q <= 0); 165734#L22 assume !(~q > ~p); 165675#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165676#$Ultimate##0 ~p := #in~p;~q := #in~q; 165717#L20 assume !(~p <= 0); 165704#L21 assume !(~q <= 0); 165699#L22 assume !(~q > ~p); 165687#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165690#$Ultimate##0 ~p := #in~p;~q := #in~q; 165727#L20 assume !(~p <= 0); 165706#L21 assume !(~q <= 0); 165707#L22 assume !(~q > ~p); 165715#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165716#$Ultimate##0 ~p := #in~p;~q := #in~q; 165765#L20 assume ~p <= 0;#res := 1; 165733#partsFINAL assume true; 165714#partsEXIT >#64#return; 165709#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165710#$Ultimate##0 ~p := #in~p;~q := #in~q; 165713#L20 assume !(~p <= 0); 165712#L21 assume ~q <= 0;#res := 0; 165711#partsFINAL assume true; 165708#partsEXIT >#66#return; 165684#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165698#partsFINAL assume true; 165689#partsEXIT >#64#return; 165682#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165685#$Ultimate##0 ~p := #in~p;~q := #in~q; 165692#L20 assume !(~p <= 0); 165691#L21 assume ~q <= 0;#res := 0; 165686#partsFINAL assume true; 165681#partsEXIT >#66#return; 165680#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165678#partsFINAL assume true; 165674#partsEXIT >#64#return; 165671#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165672#$Ultimate##0 ~p := #in~p;~q := #in~q; 165679#L20 assume !(~p <= 0); 165677#L21 assume ~q <= 0;#res := 0; 165673#partsFINAL assume true; 165670#partsEXIT >#66#return; 165669#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165667#partsFINAL assume true; 165607#partsEXIT >#66#return; 165615#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165725#partsFINAL assume true; 165722#partsEXIT >#68#return; 165723#L36-1 havoc main_#t~ret8#1; 165777#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 165773#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 165589#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 165592#$Ultimate##0 ~p := #in~p;~q := #in~q; 165718#L20 assume !(~p <= 0); 165705#L21 assume !(~q <= 0); 165700#L22 assume !(~q > ~p); 165694#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165695#$Ultimate##0 ~p := #in~p;~q := #in~q; 165697#L20 assume ~p <= 0;#res := 1; 165696#partsFINAL assume true; 165693#partsEXIT >#64#return; 165599#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165600#$Ultimate##0 ~p := #in~p;~q := #in~q; 165772#L20 assume !(~p <= 0); 165771#L21 assume !(~q <= 0); 165769#L22 assume !(~q > ~p); 165619#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165622#$Ultimate##0 ~p := #in~p;~q := #in~q; 165655#L20 assume !(~p <= 0); 165646#L21 assume !(~q <= 0); 165645#L22 assume ~q > ~p; 165632#L22-1 call #t~ret0 := parts(~p, ~p);< 165633#$Ultimate##0 ~p := #in~p;~q := #in~q; 165666#L20 assume !(~p <= 0); 165665#L21 assume !(~q <= 0); 165663#L22 assume !(~q > ~p); 165659#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165660#$Ultimate##0 ~p := #in~p;~q := #in~q; 165664#L20 assume ~p <= 0;#res := 1; 165662#partsFINAL assume true; 165658#partsEXIT >#64#return; 165638#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165639#$Ultimate##0 ~p := #in~p;~q := #in~q; 165661#L20 assume !(~p <= 0); 165657#L21 assume ~q <= 0;#res := 0; 165656#partsFINAL assume true; 165637#partsEXIT >#66#return; 165636#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165634#partsFINAL assume true; 165631#partsEXIT >#62#return; 165630#L22-2 #res := #t~ret0;havoc #t~ret0; 165625#partsFINAL assume true; 165618#partsEXIT >#64#return; 165610#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165616#$Ultimate##0 ~p := #in~p;~q := #in~q; 165770#L20 assume !(~p <= 0); 165736#L21 assume !(~q <= 0); 165737#L22 assume !(~q > ~p); 165675#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165676#$Ultimate##0 ~p := #in~p;~q := #in~q; 165717#L20 assume !(~p <= 0); 165704#L21 assume !(~q <= 0); 165699#L22 assume !(~q > ~p); 165687#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165690#$Ultimate##0 ~p := #in~p;~q := #in~q; 165727#L20 assume !(~p <= 0); 165706#L21 assume !(~q <= 0); 165707#L22 assume !(~q > ~p); 165715#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165716#$Ultimate##0 ~p := #in~p;~q := #in~q; 165765#L20 assume ~p <= 0;#res := 1; 165733#partsFINAL assume true; 165714#partsEXIT >#64#return; 165709#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165710#$Ultimate##0 ~p := #in~p;~q := #in~q; 165713#L20 assume !(~p <= 0); 165712#L21 assume ~q <= 0;#res := 0; 165711#partsFINAL assume true; 165708#partsEXIT >#66#return; 165684#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165698#partsFINAL assume true; 165689#partsEXIT >#64#return; 165682#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165685#$Ultimate##0 ~p := #in~p;~q := #in~q; 165692#L20 assume !(~p <= 0); 165691#L21 assume ~q <= 0;#res := 0; 165686#partsFINAL assume true; 165681#partsEXIT >#66#return; 165680#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165678#partsFINAL assume true; 165674#partsEXIT >#64#return; 165671#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165672#$Ultimate##0 ~p := #in~p;~q := #in~q; 165679#L20 assume !(~p <= 0); 165677#L21 assume ~q <= 0;#res := 0; 165673#partsFINAL assume true; 165670#partsEXIT >#66#return; 165669#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165667#partsFINAL assume true; 165607#partsEXIT >#66#return; 165602#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165601#partsFINAL assume true; 165598#partsEXIT >#66#return; 165596#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165593#partsFINAL assume true; 165587#partsEXIT >#68#return; 165590#L36-1 havoc main_#t~ret8#1; 165147#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 165148#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164216#L36 [2023-02-15 23:15:33,466 INFO L750 eck$LassoCheckResult]: Loop: 164216#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 164218#$Ultimate##0 ~p := #in~p;~q := #in~q; 165149#L20 assume !(~p <= 0); 165151#L21 assume !(~q <= 0); 165245#L22 assume ~q > ~p; 165230#L22-1 call #t~ret0 := parts(~p, ~p);< 165232#$Ultimate##0 ~p := #in~p;~q := #in~q; 165287#L20 assume !(~p <= 0); 165286#L21 assume !(~q <= 0); 165284#L22 assume !(~q > ~p); 165279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 165280#$Ultimate##0 ~p := #in~p;~q := #in~q; 165282#L20 assume ~p <= 0;#res := 1; 165281#partsFINAL assume true; 165278#partsEXIT >#64#return; 164622#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165243#$Ultimate##0 ~p := #in~p;~q := #in~q; 165290#L20 assume !(~p <= 0); 165289#L21 assume !(~q <= 0); 165288#L22 assume !(~q > ~p); 164617#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164620#$Ultimate##0 ~p := #in~p;~q := #in~q; 164634#L20 assume !(~p <= 0); 164630#L21 assume !(~q <= 0); 164628#L22 assume ~q > ~p; 164625#L22-1 call #t~ret0 := parts(~p, ~p);< 164626#$Ultimate##0 ~p := #in~p;~q := #in~q; 164645#L20 assume !(~p <= 0); 164644#L21 assume !(~q <= 0); 164641#L22 assume !(~q > ~p); 164637#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164638#$Ultimate##0 ~p := #in~p;~q := #in~q; 164643#L20 assume ~p <= 0;#res := 1; 164640#partsFINAL assume true; 164636#partsEXIT >#64#return; 164632#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164633#$Ultimate##0 ~p := #in~p;~q := #in~q; 164642#L20 assume !(~p <= 0); 164639#L21 assume ~q <= 0;#res := 0; 164635#partsFINAL assume true; 164631#partsEXIT >#66#return; 164629#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 164627#partsFINAL assume true; 164624#partsEXIT >#62#return; 164623#L22-2 #res := #t~ret0;havoc #t~ret0; 164621#partsFINAL assume true; 164614#partsEXIT >#64#return; 164532#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164547#$Ultimate##0 ~p := #in~p;~q := #in~q; 164545#L20 assume !(~p <= 0); 164541#L21 assume !(~q <= 0); 164542#L22 assume !(~q > ~p); 164426#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164429#$Ultimate##0 ~p := #in~p;~q := #in~q; 164526#L20 assume !(~p <= 0); 164524#L21 assume !(~q <= 0); 164525#L22 assume !(~q > ~p); 164477#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164560#$Ultimate##0 ~p := #in~p;~q := #in~q; 164558#L20 assume !(~p <= 0); 164555#L21 assume !(~q <= 0); 164554#L22 assume !(~q > ~p); 164481#L23 call #t~ret1 := parts(~p - ~q, ~q);< 164483#$Ultimate##0 ~p := #in~p;~q := #in~q; 164548#L20 assume ~p <= 0;#res := 1; 164546#partsFINAL assume true; 164480#partsEXIT >#64#return; 164473#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 164475#$Ultimate##0 ~p := #in~p;~q := #in~q; 164484#L20 assume !(~p <= 0); 164479#L21 assume ~q <= 0;#res := 0; 164476#partsFINAL assume true; 164471#partsEXIT >#66#return; 164474#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165285#partsFINAL assume true; 165275#partsEXIT >#64#return; 165271#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165273#$Ultimate##0 ~p := #in~p;~q := #in~q; 165277#L20 assume !(~p <= 0); 165276#L21 assume ~q <= 0;#res := 0; 165274#partsFINAL assume true; 165270#partsEXIT >#66#return; 165269#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165267#partsFINAL assume true; 165266#partsEXIT >#64#return; 165260#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 165261#$Ultimate##0 ~p := #in~p;~q := #in~q; 165268#L20 assume !(~p <= 0); 165265#L21 assume ~q <= 0;#res := 0; 165264#partsFINAL assume true; 165259#partsEXIT >#66#return; 165258#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165257#partsFINAL assume true; 165254#partsEXIT >#66#return; 165238#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165283#partsFINAL assume true; 165242#partsEXIT >#66#return; 165241#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 165240#partsFINAL assume true; 165229#partsEXIT >#62#return; 165231#L22-2 #res := #t~ret0;havoc #t~ret0; 165594#partsFINAL assume true; 165591#partsEXIT >#68#return; 165410#L36-1 havoc main_#t~ret8#1; 165411#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 164381#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 164216#L36 [2023-02-15 23:15:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash -533830119, now seen corresponding path program 10 times [2023-02-15 23:15:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:33,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229691967] [2023-02-15 23:15:33,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:33,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:33,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -2124724466, now seen corresponding path program 2 times [2023-02-15 23:15:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:33,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539423158] [2023-02-15 23:15:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:33,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:33,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash -201339098, now seen corresponding path program 11 times [2023-02-15 23:15:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:33,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858676893] [2023-02-15 23:15:33,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:15:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 23:15:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 23:15:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-02-15 23:15:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-02-15 23:15:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-02-15 23:15:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-02-15 23:15:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-15 23:15:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-02-15 23:15:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-02-15 23:15:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-02-15 23:15:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-02-15 23:15:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2023-02-15 23:15:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2023-02-15 23:15:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2023-02-15 23:15:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2023-02-15 23:15:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 626 [2023-02-15 23:15:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25763 backedges. 48 proven. 600 refuted. 0 times theorem prover too weak. 25115 trivial. 0 not checked. [2023-02-15 23:15:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:34,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858676893] [2023-02-15 23:15:34,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858676893] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:34,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226338496] [2023-02-15 23:15:34,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:15:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:34,323 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:34,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2023-02-15 23:15:34,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-02-15 23:15:34,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:34,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 1816 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 23:15:34,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25763 backedges. 989 proven. 749 refuted. 0 times theorem prover too weak. 24025 trivial. 0 not checked. [2023-02-15 23:15:34,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25763 backedges. 890 proven. 848 refuted. 0 times theorem prover too weak. 24025 trivial. 0 not checked. [2023-02-15 23:15:35,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226338496] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:35,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:35,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 22 [2023-02-15 23:15:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555920656] [2023-02-15 23:15:35,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:36,078 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:36,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:36,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:36,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:36,097 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:15:36,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:36,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:36,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2023-02-15 23:15:36,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:36,097 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:36,098 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,099 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,100 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,130 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:36,131 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:15:36,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,135 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-02-15 23:15:36,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:36,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:36,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:36,159 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=0} Honda state: {ULTIMATE.start_main_#t~ret8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:36,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,163 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-02-15 23:15:36,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:36,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:36,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:15:36,174 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:15:36,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,178 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2023-02-15 23:15:36,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:36,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:36,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,207 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2023-02-15 23:15:36,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:15:36,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:36,363 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:15:36,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,367 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:36,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:36,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:36,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:36,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:15:36,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:36,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:36,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2023-02-15 23:15:36,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:36,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:36,368 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,372 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:36,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:36,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:15:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,404 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2023-02-15 23:15:36,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:36,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:36,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:36,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:36,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:36,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:36,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:36,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:36,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:36,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,432 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2023-02-15 23:15:36,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:36,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:36,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:36,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:36,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:36,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:36,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:36,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:36,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:15:36,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,446 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2023-02-15 23:15:36,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:36,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:36,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:36,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:36,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:36,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:36,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:36,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:36,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:36,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:36,460 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:15:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:36,462 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:36,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-02-15 23:15:36,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:36,463 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:36,463 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:36,463 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-15 23:15:36,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-02-15 23:15:36,466 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:36,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:36,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 3904 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 23:15:36,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:37,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:39,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:15:39,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:15:39,899 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:15:39,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:39,921 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1933 states and 2213 transitions. Complement of second has 9 states. [2023-02-15 23:15:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:15:39,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 626 letters. Loop has 106 letters. [2023-02-15 23:15:39,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:39,922 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:40,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 3904 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 23:15:40,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:43,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:15:43,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:15:43,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:15:43,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:43,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1933 states and 2213 transitions. Complement of second has 9 states. [2023-02-15 23:15:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:15:43,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 626 letters. Loop has 106 letters. [2023-02-15 23:15:43,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:43,274 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:43,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 3904 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 23:15:43,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:46,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:15:46,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:15:46,581 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:15:46,581 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:46,641 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1896 states and 2174 transitions. cyclomatic complexity: 305. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 3888 states and 4440 transitions. Complement of second has 10 states. [2023-02-15 23:15:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2023-02-15 23:15:46,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 626 letters. Loop has 106 letters. [2023-02-15 23:15:46,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:46,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 732 letters. Loop has 106 letters. [2023-02-15 23:15:46,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:46,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 626 letters. Loop has 212 letters. [2023-02-15 23:15:46,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:46,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3888 states and 4440 transitions. [2023-02-15 23:15:46,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2023-02-15 23:15:46,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3888 states to 2045 states and 2328 transitions. [2023-02-15 23:15:46,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-15 23:15:46,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2023-02-15 23:15:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2045 states and 2328 transitions. [2023-02-15 23:15:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:46,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2045 states and 2328 transitions. [2023-02-15 23:15:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states and 2328 transitions. [2023-02-15 23:15:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2023-02-15 23:15:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1418 states have (on average 1.041607898448519) internal successors, (1477), 1449 states have internal predecessors, (1477), 347 states have call successors, (355), 239 states have call predecessors, (355), 280 states have return successors, (496), 356 states have call predecessors, (496), 347 states have call successors, (496) [2023-02-15 23:15:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2328 transitions. [2023-02-15 23:15:46,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2045 states and 2328 transitions. [2023-02-15 23:15:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:15:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 23:15:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-02-15 23:15:46,739 INFO L87 Difference]: Start difference. First operand 2045 states and 2328 transitions. Second operand has 23 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 23 states have internal predecessors, (85), 18 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (24), 17 states have call predecessors, (24), 18 states have call successors, (24) [2023-02-15 23:15:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:15:47,037 INFO L93 Difference]: Finished difference Result 2740 states and 3395 transitions. [2023-02-15 23:15:47,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2740 states and 3395 transitions. [2023-02-15 23:15:47,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 72 [2023-02-15 23:15:47,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2740 states to 2346 states and 2835 transitions. [2023-02-15 23:15:47,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2023-02-15 23:15:47,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2023-02-15 23:15:47,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2346 states and 2835 transitions. [2023-02-15 23:15:47,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:15:47,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2346 states and 2835 transitions. [2023-02-15 23:15:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states and 2835 transitions. [2023-02-15 23:15:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2107. [2023-02-15 23:15:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1469 states have (on average 1.0442477876106195) internal successors, (1534), 1494 states have internal predecessors, (1534), 358 states have call successors, (366), 239 states have call predecessors, (366), 280 states have return successors, (532), 373 states have call predecessors, (532), 358 states have call successors, (532) [2023-02-15 23:15:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2432 transitions. [2023-02-15 23:15:47,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2107 states and 2432 transitions. [2023-02-15 23:15:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 23:15:47,083 INFO L428 stractBuchiCegarLoop]: Abstraction has 2107 states and 2432 transitions. [2023-02-15 23:15:47,084 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-02-15 23:15:47,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2107 states and 2432 transitions. [2023-02-15 23:15:47,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2023-02-15 23:15:47,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:15:47,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:15:47,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [111, 111, 82, 49, 39, 39, 39, 39, 39, 39, 33, 29, 24, 23, 23, 23, 23, 10, 10, 10, 10, 4, 3, 3, 1, 1, 1, 1] [2023-02-15 23:15:47,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 23:15:47,092 INFO L748 eck$LassoCheckResult]: Stem: 191570#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 191525#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 191526#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 191523#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 191524#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 191585#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191778#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191779#$Ultimate##0 ~p := #in~p;~q := #in~q; 191781#L20 assume ~p <= 0;#res := 1; 191780#partsFINAL assume true; 191777#partsEXIT >#68#return; 191776#L36-1 havoc main_#t~ret8#1; 191775#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191773#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191770#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191771#$Ultimate##0 ~p := #in~p;~q := #in~q; 191774#L20 assume ~p <= 0;#res := 1; 191772#partsFINAL assume true; 191769#partsEXIT >#68#return; 191768#L36-1 havoc main_#t~ret8#1; 191767#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191765#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191762#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191763#$Ultimate##0 ~p := #in~p;~q := #in~q; 191766#L20 assume ~p <= 0;#res := 1; 191764#partsFINAL assume true; 191761#partsEXIT >#68#return; 191760#L36-1 havoc main_#t~ret8#1; 191759#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191757#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191751#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191745#$Ultimate##0 ~p := #in~p;~q := #in~q; 191756#L20 assume ~p <= 0;#res := 1; 191754#partsFINAL assume true; 191750#partsEXIT >#68#return; 191753#L36-1 havoc main_#t~ret8#1; 191758#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191755#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191752#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191745#$Ultimate##0 ~p := #in~p;~q := #in~q; 191756#L20 assume ~p <= 0;#res := 1; 191754#partsFINAL assume true; 191750#partsEXIT >#68#return; 191749#L36-1 havoc main_#t~ret8#1; 191748#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191747#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191556#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191555#$Ultimate##0 ~p := #in~p;~q := #in~q; 191557#L20 assume ~p <= 0;#res := 1; 192091#partsFINAL assume true; 192090#partsEXIT >#68#return; 192052#L36-1 havoc main_#t~ret8#1; 192046#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192044#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 192043#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 191586#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 191587#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192415#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192416#$Ultimate##0 ~p := #in~p;~q := #in~q; 192426#L20 assume !(~p <= 0); 192424#L21 assume ~q <= 0;#res := 0; 192422#partsFINAL assume true; 192414#partsEXIT >#68#return; 192409#L36-1 havoc main_#t~ret8#1; 192405#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192402#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192398#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192399#$Ultimate##0 ~p := #in~p;~q := #in~q; 192425#L20 assume !(~p <= 0); 192423#L21 assume !(~q <= 0); 192421#L22 assume !(~q > ~p); 192412#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192413#$Ultimate##0 ~p := #in~p;~q := #in~q; 192420#L20 assume ~p <= 0;#res := 1; 192418#partsFINAL assume true; 192411#partsEXIT >#64#return; 192407#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192408#$Ultimate##0 ~p := #in~p;~q := #in~q; 192419#L20 assume !(~p <= 0); 192417#L21 assume ~q <= 0;#res := 0; 192410#partsFINAL assume true; 192406#partsEXIT >#66#return; 192404#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192401#partsFINAL assume true; 192397#partsEXIT >#68#return; 192395#L36-1 havoc main_#t~ret8#1; 192394#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192393#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192389#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192390#$Ultimate##0 ~p := #in~p;~q := #in~q; 192403#L20 assume !(~p <= 0); 192400#L21 assume !(~q <= 0); 192396#L22 assume ~q > ~p; 192380#L22-1 call #t~ret0 := parts(~p, ~p);< 192383#$Ultimate##0 ~p := #in~p;~q := #in~q; 192442#L20 assume !(~p <= 0); 192441#L21 assume !(~q <= 0); 192438#L22 assume !(~q > ~p); 192434#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192435#$Ultimate##0 ~p := #in~p;~q := #in~q; 192440#L20 assume ~p <= 0;#res := 1; 192437#partsFINAL assume true; 192433#partsEXIT >#64#return; 192430#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192431#$Ultimate##0 ~p := #in~p;~q := #in~q; 192439#L20 assume !(~p <= 0); 192436#L21 assume ~q <= 0;#res := 0; 192432#partsFINAL assume true; 192429#partsEXIT >#66#return; 192428#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192427#partsFINAL assume true; 192379#partsEXIT >#62#return; 192382#L22-2 #res := #t~ret0;havoc #t~ret0; 192392#partsFINAL assume true; 192388#partsEXIT >#68#return; 192386#L36-1 havoc main_#t~ret8#1; 192384#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192377#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192371#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192060#$Ultimate##0 ~p := #in~p;~q := #in~q; 192391#L20 assume !(~p <= 0); 192387#L21 assume !(~q <= 0); 192385#L22 assume ~q > ~p; 192381#L22-1 call #t~ret0 := parts(~p, ~p);< 192383#$Ultimate##0 ~p := #in~p;~q := #in~q; 192442#L20 assume !(~p <= 0); 192441#L21 assume !(~q <= 0); 192438#L22 assume !(~q > ~p); 192434#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192435#$Ultimate##0 ~p := #in~p;~q := #in~q; 192440#L20 assume ~p <= 0;#res := 1; 192437#partsFINAL assume true; 192433#partsEXIT >#64#return; 192430#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192431#$Ultimate##0 ~p := #in~p;~q := #in~q; 192439#L20 assume !(~p <= 0); 192436#L21 assume ~q <= 0;#res := 0; 192432#partsFINAL assume true; 192429#partsEXIT >#66#return; 192428#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192427#partsFINAL assume true; 192379#partsEXIT >#62#return; 192376#L22-2 #res := #t~ret0;havoc #t~ret0; 192374#partsFINAL assume true; 192370#partsEXIT >#68#return; 192373#L36-1 havoc main_#t~ret8#1; 192378#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192375#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192372#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192060#$Ultimate##0 ~p := #in~p;~q := #in~q; 192391#L20 assume !(~p <= 0); 192387#L21 assume !(~q <= 0); 192385#L22 assume ~q > ~p; 192381#L22-1 call #t~ret0 := parts(~p, ~p);< 192383#$Ultimate##0 ~p := #in~p;~q := #in~q; 192442#L20 assume !(~p <= 0); 192441#L21 assume !(~q <= 0); 192438#L22 assume !(~q > ~p); 192434#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192435#$Ultimate##0 ~p := #in~p;~q := #in~q; 192440#L20 assume ~p <= 0;#res := 1; 192437#partsFINAL assume true; 192433#partsEXIT >#64#return; 192430#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192431#$Ultimate##0 ~p := #in~p;~q := #in~q; 192439#L20 assume !(~p <= 0); 192436#L21 assume ~q <= 0;#res := 0; 192432#partsFINAL assume true; 192429#partsEXIT >#66#return; 192428#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192427#partsFINAL assume true; 192379#partsEXIT >#62#return; 192376#L22-2 #res := #t~ret0;havoc #t~ret0; 192374#partsFINAL assume true; 192370#partsEXIT >#68#return; 192369#L36-1 havoc main_#t~ret8#1; 192089#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192086#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192059#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192061#$Ultimate##0 ~p := #in~p;~q := #in~q; 192074#L20 assume !(~p <= 0); 192070#L21 assume !(~q <= 0); 192068#L22 assume ~q > ~p; 192065#L22-1 call #t~ret0 := parts(~p, ~p);< 192066#$Ultimate##0 ~p := #in~p;~q := #in~q; 192085#L20 assume !(~p <= 0); 192084#L21 assume !(~q <= 0); 192081#L22 assume !(~q > ~p); 192077#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192078#$Ultimate##0 ~p := #in~p;~q := #in~q; 192083#L20 assume ~p <= 0;#res := 1; 192080#partsFINAL assume true; 192076#partsEXIT >#64#return; 192072#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192073#$Ultimate##0 ~p := #in~p;~q := #in~q; 192082#L20 assume !(~p <= 0); 192079#L21 assume ~q <= 0;#res := 0; 192075#partsFINAL assume true; 192071#partsEXIT >#66#return; 192069#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192067#partsFINAL assume true; 192064#partsEXIT >#62#return; 192063#L22-2 #res := #t~ret0;havoc #t~ret0; 192062#partsFINAL assume true; 192058#partsEXIT >#68#return; 192051#L36-1 havoc main_#t~ret8#1; 192047#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192045#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 191541#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 191542#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 192027#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192023#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192025#$Ultimate##0 ~p := #in~p;~q := #in~q; 192042#L20 assume !(~p <= 0); 192039#L21 assume ~q <= 0;#res := 0; 192036#partsFINAL assume true; 192021#partsEXIT >#68#return; 191998#L36-1 havoc main_#t~ret8#1; 191994#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191987#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191976#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191978#$Ultimate##0 ~p := #in~p;~q := #in~q; 192020#L20 assume !(~p <= 0); 192016#L21 assume !(~q <= 0); 192014#L22 assume !(~q > ~p); 192009#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192010#$Ultimate##0 ~p := #in~p;~q := #in~q; 192035#L20 assume !(~p <= 0); 192034#L21 assume !(~q <= 0); 192033#L22 assume !(~q > ~p); 192031#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192032#$Ultimate##0 ~p := #in~p;~q := #in~q; 192041#L20 assume ~p <= 0;#res := 1; 192038#partsFINAL assume true; 192030#partsEXIT >#64#return; 192018#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192019#$Ultimate##0 ~p := #in~p;~q := #in~q; 192029#L20 assume !(~p <= 0); 192028#L21 assume ~q <= 0;#res := 0; 192026#partsFINAL assume true; 192017#partsEXIT >#66#return; 192015#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192013#partsFINAL assume true; 192008#partsEXIT >#64#return; 191996#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191997#$Ultimate##0 ~p := #in~p;~q := #in~q; 192012#L20 assume !(~p <= 0); 192007#L21 assume ~q <= 0;#res := 0; 192005#partsFINAL assume true; 191995#partsEXIT >#66#return; 191993#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191986#partsFINAL assume true; 191974#partsEXIT >#68#return; 191977#L36-1 havoc main_#t~ret8#1; 192132#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192130#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192122#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192128#$Ultimate##0 ~p := #in~p;~q := #in~q; 192242#L20 assume !(~p <= 0); 192241#L21 assume !(~q <= 0); 192238#L22 assume !(~q > ~p); 192240#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192260#$Ultimate##0 ~p := #in~p;~q := #in~q; 192261#L20 assume ~p <= 0;#res := 1; 192245#partsFINAL assume true; 192246#partsEXIT >#64#return; 192135#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192136#$Ultimate##0 ~p := #in~p;~q := #in~q; 192643#L20 assume !(~p <= 0); 192642#L21 assume !(~q <= 0); 192162#L22 assume !(~q > ~p); 192148#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192153#$Ultimate##0 ~p := #in~p;~q := #in~q; 192196#L20 assume !(~p <= 0); 192192#L21 assume !(~q <= 0); 192190#L22 assume !(~q > ~p); 192178#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192180#$Ultimate##0 ~p := #in~p;~q := #in~q; 192189#L20 assume ~p <= 0;#res := 1; 192188#partsFINAL assume true; 192177#partsEXIT >#64#return; 192170#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192172#$Ultimate##0 ~p := #in~p;~q := #in~q; 192184#L20 assume !(~p <= 0); 192182#L21 assume ~q <= 0;#res := 0; 192174#partsFINAL assume true; 192168#partsEXIT >#66#return; 192166#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192155#partsFINAL assume true; 192147#partsEXIT >#64#return; 192142#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192144#$Ultimate##0 ~p := #in~p;~q := #in~q; 192163#L20 assume !(~p <= 0); 192154#L21 assume ~q <= 0;#res := 0; 192145#partsFINAL assume true; 192140#partsEXIT >#66#return; 192139#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192138#partsFINAL assume true; 192133#partsEXIT >#66#return; 192131#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192129#partsFINAL assume true; 192121#partsEXIT >#68#return; 192120#L36-1 havoc main_#t~ret8#1; 192119#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192117#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191806#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191703#$Ultimate##0 ~p := #in~p;~q := #in~q; 191847#L20 assume !(~p <= 0); 191835#L21 assume !(~q <= 0); 191822#L22 assume ~q > ~p; 191823#L22-1 call #t~ret0 := parts(~p, ~p);< 191877#$Ultimate##0 ~p := #in~p;~q := #in~q; 191956#L20 assume !(~p <= 0); 191954#L21 assume !(~q <= 0); 191951#L22 assume !(~q > ~p); 191942#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191943#$Ultimate##0 ~p := #in~p;~q := #in~q; 191953#L20 assume ~p <= 0;#res := 1; 191950#partsFINAL assume true; 191941#partsEXIT >#64#return; 191914#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191932#$Ultimate##0 ~p := #in~p;~q := #in~q; 191927#L20 assume !(~p <= 0); 191918#L21 assume !(~q <= 0); 191915#L22 assume !(~q > ~p); 191892#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191895#$Ultimate##0 ~p := #in~p;~q := #in~q; 191946#L20 assume !(~p <= 0); 191939#L21 assume !(~q <= 0); 191936#L22 assume !(~q > ~p); 191929#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191931#$Ultimate##0 ~p := #in~p;~q := #in~q; 191937#L20 assume ~p <= 0;#res := 1; 191933#partsFINAL assume true; 191928#partsEXIT >#64#return; 191923#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191926#$Ultimate##0 ~p := #in~p;~q := #in~q; 192050#L20 assume !(~p <= 0); 192049#L21 assume ~q <= 0;#res := 0; 192048#partsFINAL assume true; 191922#partsEXIT >#66#return; 191917#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191913#partsFINAL assume true; 191890#partsEXIT >#64#return; 191894#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192099#$Ultimate##0 ~p := #in~p;~q := #in~q; 192102#L20 assume !(~p <= 0); 192101#L21 assume ~q <= 0;#res := 0; 192100#partsFINAL assume true; 192097#partsEXIT >#66#return; 192098#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192094#partsFINAL assume true; 192095#partsEXIT >#66#return; 191883#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191884#partsFINAL assume true; 192108#partsEXIT >#62#return; 192107#L22-2 #res := #t~ret0;havoc #t~ret0; 191808#partsFINAL assume true; 191809#partsEXIT >#68#return; 192105#L36-1 havoc main_#t~ret8#1; 192685#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192522#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191803#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191703#$Ultimate##0 ~p := #in~p;~q := #in~q; 191847#L20 assume !(~p <= 0); 191835#L21 assume !(~q <= 0); 191822#L22 assume ~q > ~p; 191823#L22-1 call #t~ret0 := parts(~p, ~p);< 191877#$Ultimate##0 ~p := #in~p;~q := #in~q; 191956#L20 assume !(~p <= 0); 191954#L21 assume !(~q <= 0); 191951#L22 assume !(~q > ~p); 191942#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191943#$Ultimate##0 ~p := #in~p;~q := #in~q; 191953#L20 assume ~p <= 0;#res := 1; 191950#partsFINAL assume true; 191941#partsEXIT >#64#return; 191914#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191932#$Ultimate##0 ~p := #in~p;~q := #in~q; 191927#L20 assume !(~p <= 0); 191918#L21 assume !(~q <= 0); 191915#L22 assume !(~q > ~p); 191892#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191895#$Ultimate##0 ~p := #in~p;~q := #in~q; 191946#L20 assume !(~p <= 0); 191939#L21 assume !(~q <= 0); 191936#L22 assume !(~q > ~p); 191929#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191931#$Ultimate##0 ~p := #in~p;~q := #in~q; 191937#L20 assume ~p <= 0;#res := 1; 191933#partsFINAL assume true; 191928#partsEXIT >#64#return; 191923#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191926#$Ultimate##0 ~p := #in~p;~q := #in~q; 192050#L20 assume !(~p <= 0); 192049#L21 assume ~q <= 0;#res := 0; 192048#partsFINAL assume true; 191922#partsEXIT >#66#return; 191917#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191913#partsFINAL assume true; 191890#partsEXIT >#64#return; 191894#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192099#$Ultimate##0 ~p := #in~p;~q := #in~q; 192102#L20 assume !(~p <= 0); 192101#L21 assume ~q <= 0;#res := 0; 192100#partsFINAL assume true; 192097#partsEXIT >#66#return; 192098#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192094#partsFINAL assume true; 192095#partsEXIT >#66#return; 191883#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191884#partsFINAL assume true; 192108#partsEXIT >#62#return; 192107#L22-2 #res := #t~ret0;havoc #t~ret0; 191808#partsFINAL assume true; 191809#partsEXIT >#68#return; 191801#L36-1 havoc main_#t~ret8#1; 191787#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191788#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191565#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191699#$Ultimate##0 ~p := #in~p;~q := #in~q; 191697#L20 assume !(~p <= 0); 191695#L21 assume !(~q <= 0); 191694#L22 assume ~q > ~p; 191546#L22-1 call #t~ret0 := parts(~p, ~p);< 191567#$Ultimate##0 ~p := #in~p;~q := #in~q; 191612#L20 assume !(~p <= 0); 191613#L21 assume !(~q <= 0); 191545#L22 assume !(~q > ~p); 191547#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191629#$Ultimate##0 ~p := #in~p;~q := #in~q; 191633#L20 assume ~p <= 0;#res := 1; 191634#partsFINAL assume true; 191628#partsEXIT >#64#return; 191624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191671#$Ultimate##0 ~p := #in~p;~q := #in~q; 191669#L20 assume !(~p <= 0); 191663#L21 assume !(~q <= 0); 191657#L22 assume !(~q > ~p); 191532#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191654#$Ultimate##0 ~p := #in~p;~q := #in~q; 191686#L20 assume !(~p <= 0); 191604#L21 assume !(~q <= 0); 191606#L22 assume !(~q > ~p); 191531#L23 call #t~ret1 := parts(~p - ~q, ~q);< 191535#$Ultimate##0 ~p := #in~p;~q := #in~q; 191687#L20 assume ~p <= 0;#res := 1; 191685#partsFINAL assume true; 191674#partsEXIT >#64#return; 191665#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191667#$Ultimate##0 ~p := #in~p;~q := #in~q; 191684#L20 assume !(~p <= 0); 191683#L21 assume ~q <= 0;#res := 0; 191673#partsFINAL assume true; 191664#partsEXIT >#66#return; 191660#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191656#partsFINAL assume true; 191652#partsEXIT >#64#return; 191642#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 191648#$Ultimate##0 ~p := #in~p;~q := #in~q; 191659#L20 assume !(~p <= 0); 191655#L21 assume ~q <= 0;#res := 0; 191651#partsFINAL assume true; 191641#partsEXIT >#66#return; 191643#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191637#partsFINAL assume true; 191638#partsEXIT >#66#return; 191621#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 191622#partsFINAL assume true; 191617#partsEXIT >#62#return; 191618#L22-2 #res := #t~ret0;havoc #t~ret0; 191580#partsFINAL assume true; 191581#partsEXIT >#68#return; 191578#L36-1 havoc main_#t~ret8#1; 191579#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192861#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 192860#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 192859#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 192858#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192856#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192857#$Ultimate##0 ~p := #in~p;~q := #in~q; 192874#L20 assume !(~p <= 0); 192872#L21 assume ~q <= 0;#res := 0; 192870#partsFINAL assume true; 192855#partsEXIT >#68#return; 192854#L36-1 havoc main_#t~ret8#1; 192847#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192843#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192813#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192814#$Ultimate##0 ~p := #in~p;~q := #in~q; 192875#L20 assume !(~p <= 0); 192873#L21 assume !(~q <= 0); 192871#L22 assume !(~q > ~p); 192865#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192869#$Ultimate##0 ~p := #in~p;~q := #in~q; 192894#L20 assume !(~p <= 0); 192893#L21 assume !(~q <= 0); 192892#L22 assume !(~q > ~p); 192888#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192891#$Ultimate##0 ~p := #in~p;~q := #in~q; 192900#L20 assume !(~p <= 0); 192898#L21 assume !(~q <= 0); 192896#L22 assume !(~q > ~p); 192897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192905#$Ultimate##0 ~p := #in~p;~q := #in~q; 192930#L20 assume ~p <= 0;#res := 1; 192929#partsFINAL assume true; 192904#partsEXIT >#64#return; 192902#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192903#$Ultimate##0 ~p := #in~p;~q := #in~q; 192941#L20 assume !(~p <= 0); 192936#L21 assume ~q <= 0;#res := 0; 192935#partsFINAL assume true; 192901#partsEXIT >#66#return; 192899#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192895#partsFINAL assume true; 192887#partsEXIT >#64#return; 192882#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192885#$Ultimate##0 ~p := #in~p;~q := #in~q; 192917#L20 assume !(~p <= 0); 192915#L21 assume ~q <= 0;#res := 0; 192913#partsFINAL assume true; 192881#partsEXIT >#66#return; 192877#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192876#partsFINAL assume true; 192868#partsEXIT >#64#return; 192849#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192852#$Ultimate##0 ~p := #in~p;~q := #in~q; 192886#L20 assume !(~p <= 0); 192878#L21 assume ~q <= 0;#res := 0; 192862#partsFINAL assume true; 192848#partsEXIT >#66#return; 192845#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192841#partsFINAL assume true; 192812#partsEXIT >#68#return; 192802#L36-1 havoc main_#t~ret8#1; 192798#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192789#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192790#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192982#$Ultimate##0 ~p := #in~p;~q := #in~q; 193167#L20 assume !(~p <= 0); 193163#L21 assume !(~q <= 0); 193159#L22 assume !(~q > ~p); 193155#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193156#$Ultimate##0 ~p := #in~p;~q := #in~q; 193186#L20 assume !(~p <= 0); 193184#L21 assume !(~q <= 0); 193182#L22 assume ~q > ~p; 193175#L22-1 call #t~ret0 := parts(~p, ~p);< 193178#$Ultimate##0 ~p := #in~p;~q := #in~q; 193209#L20 assume !(~p <= 0); 193208#L21 assume !(~q <= 0); 193206#L22 assume !(~q > ~p); 193202#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193203#$Ultimate##0 ~p := #in~p;~q := #in~q; 193210#L20 assume ~p <= 0;#res := 1; 193205#partsFINAL assume true; 193201#partsEXIT >#64#return; 193198#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193199#$Ultimate##0 ~p := #in~p;~q := #in~q; 193207#L20 assume !(~p <= 0); 193204#L21 assume ~q <= 0;#res := 0; 193200#partsFINAL assume true; 193197#partsEXIT >#66#return; 193196#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193194#partsFINAL assume true; 193174#partsEXIT >#62#return; 193173#L22-2 #res := #t~ret0;havoc #t~ret0; 193172#partsFINAL assume true; 193154#partsEXIT >#64#return; 192780#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193168#$Ultimate##0 ~p := #in~p;~q := #in~q; 193164#L20 assume !(~p <= 0); 193160#L21 assume !(~q <= 0); 192821#L22 assume !(~q > ~p); 192819#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192820#$Ultimate##0 ~p := #in~p;~q := #in~q; 192944#L20 assume !(~p <= 0); 192943#L21 assume !(~q <= 0); 192942#L22 assume !(~q > ~p); 192933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192940#$Ultimate##0 ~p := #in~p;~q := #in~q; 192958#L20 assume !(~p <= 0); 192952#L21 assume !(~q <= 0); 192953#L22 assume !(~q > ~p); 192956#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192957#$Ultimate##0 ~p := #in~p;~q := #in~q; 192962#L20 assume ~p <= 0;#res := 1; 192960#partsFINAL assume true; 192955#partsEXIT >#64#return; 192950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192951#$Ultimate##0 ~p := #in~p;~q := #in~q; 192961#L20 assume !(~p <= 0); 192959#L21 assume ~q <= 0;#res := 0; 192954#partsFINAL assume true; 192949#partsEXIT >#66#return; 192835#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192947#partsFINAL assume true; 192939#partsEXIT >#64#return; 192834#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192836#$Ultimate##0 ~p := #in~p;~q := #in~q; 192946#L20 assume !(~p <= 0); 192938#L21 assume ~q <= 0;#res := 0; 192932#partsFINAL assume true; 192832#partsEXIT >#66#return; 192828#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192824#partsFINAL assume true; 192818#partsEXIT >#64#return; 192804#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192805#$Ultimate##0 ~p := #in~p;~q := #in~q; 192817#L20 assume !(~p <= 0); 192816#L21 assume ~q <= 0;#res := 0; 192815#partsFINAL assume true; 192803#partsEXIT >#66#return; 192799#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192791#partsFINAL assume true; 192779#partsEXIT >#66#return; 192785#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192983#partsFINAL assume true; 192979#partsEXIT >#68#return; 192766#L36-1 havoc main_#t~ret8#1; 192762#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192755#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192742#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192751#$Ultimate##0 ~p := #in~p;~q := #in~q; 192972#L20 assume !(~p <= 0); 192971#L21 assume !(~q <= 0); 192967#L22 assume !(~q > ~p); 192964#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192965#$Ultimate##0 ~p := #in~p;~q := #in~q; 192970#L20 assume ~p <= 0;#res := 1; 192966#partsFINAL assume true; 192963#partsEXIT >#64#return; 192760#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192761#$Ultimate##0 ~p := #in~p;~q := #in~q; 192811#L20 assume !(~p <= 0); 192807#L21 assume !(~q <= 0); 192801#L22 assume !(~q > ~p); 192796#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192797#$Ultimate##0 ~p := #in~p;~q := #in~q; 192839#L20 assume !(~p <= 0); 192838#L21 assume !(~q <= 0); 192837#L22 assume ~q > ~p; 192809#L22-1 call #t~ret0 := parts(~p, ~p);< 192810#$Ultimate##0 ~p := #in~p;~q := #in~q; 192945#L20 assume !(~p <= 0); 192937#L21 assume !(~q <= 0); 192931#L22 assume !(~q > ~p); 192830#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192831#$Ultimate##0 ~p := #in~p;~q := #in~q; 192844#L20 assume ~p <= 0;#res := 1; 192840#partsFINAL assume true; 192829#partsEXIT >#64#return; 192826#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192827#$Ultimate##0 ~p := #in~p;~q := #in~q; 192853#L20 assume !(~p <= 0); 192846#L21 assume ~q <= 0;#res := 0; 192842#partsFINAL assume true; 192825#partsEXIT >#66#return; 192823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192822#partsFINAL assume true; 192808#partsEXIT >#62#return; 192806#L22-2 #res := #t~ret0;havoc #t~ret0; 192800#partsFINAL assume true; 192793#partsEXIT >#64#return; 192782#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192788#$Ultimate##0 ~p := #in~p;~q := #in~q; 193165#L20 assume !(~p <= 0); 193161#L21 assume !(~q <= 0); 193157#L22 assume !(~q > ~p); 192819#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192820#$Ultimate##0 ~p := #in~p;~q := #in~q; 192944#L20 assume !(~p <= 0); 192943#L21 assume !(~q <= 0); 192942#L22 assume !(~q > ~p); 192933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192940#$Ultimate##0 ~p := #in~p;~q := #in~q; 192958#L20 assume !(~p <= 0); 192952#L21 assume !(~q <= 0); 192953#L22 assume !(~q > ~p); 192956#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192957#$Ultimate##0 ~p := #in~p;~q := #in~q; 192962#L20 assume ~p <= 0;#res := 1; 192960#partsFINAL assume true; 192955#partsEXIT >#64#return; 192950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192951#$Ultimate##0 ~p := #in~p;~q := #in~q; 192961#L20 assume !(~p <= 0); 192959#L21 assume ~q <= 0;#res := 0; 192954#partsFINAL assume true; 192949#partsEXIT >#66#return; 192835#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192947#partsFINAL assume true; 192939#partsEXIT >#64#return; 192834#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192836#$Ultimate##0 ~p := #in~p;~q := #in~q; 192946#L20 assume !(~p <= 0); 192938#L21 assume ~q <= 0;#res := 0; 192932#partsFINAL assume true; 192832#partsEXIT >#66#return; 192828#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192824#partsFINAL assume true; 192818#partsEXIT >#64#return; 192804#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192805#$Ultimate##0 ~p := #in~p;~q := #in~q; 192817#L20 assume !(~p <= 0); 192816#L21 assume ~q <= 0;#res := 0; 192815#partsFINAL assume true; 192803#partsEXIT >#66#return; 192799#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192791#partsFINAL assume true; 192779#partsEXIT >#66#return; 192773#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192771#partsFINAL assume true; 192759#partsEXIT >#66#return; 192754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192752#partsFINAL assume true; 192740#partsEXIT >#68#return; 192745#L36-1 havoc main_#t~ret8#1; 193215#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 193213#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 192741#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 192751#$Ultimate##0 ~p := #in~p;~q := #in~q; 192972#L20 assume !(~p <= 0); 192971#L21 assume !(~q <= 0); 192967#L22 assume !(~q > ~p); 192964#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192965#$Ultimate##0 ~p := #in~p;~q := #in~q; 192970#L20 assume ~p <= 0;#res := 1; 192966#partsFINAL assume true; 192963#partsEXIT >#64#return; 192760#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192761#$Ultimate##0 ~p := #in~p;~q := #in~q; 192811#L20 assume !(~p <= 0); 192807#L21 assume !(~q <= 0); 192801#L22 assume !(~q > ~p); 192796#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192797#$Ultimate##0 ~p := #in~p;~q := #in~q; 192839#L20 assume !(~p <= 0); 192838#L21 assume !(~q <= 0); 192837#L22 assume ~q > ~p; 192809#L22-1 call #t~ret0 := parts(~p, ~p);< 192810#$Ultimate##0 ~p := #in~p;~q := #in~q; 192945#L20 assume !(~p <= 0); 192937#L21 assume !(~q <= 0); 192931#L22 assume !(~q > ~p); 192830#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192831#$Ultimate##0 ~p := #in~p;~q := #in~q; 192844#L20 assume ~p <= 0;#res := 1; 192840#partsFINAL assume true; 192829#partsEXIT >#64#return; 192826#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192827#$Ultimate##0 ~p := #in~p;~q := #in~q; 192853#L20 assume !(~p <= 0); 192846#L21 assume ~q <= 0;#res := 0; 192842#partsFINAL assume true; 192825#partsEXIT >#66#return; 192823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192822#partsFINAL assume true; 192808#partsEXIT >#62#return; 192806#L22-2 #res := #t~ret0;havoc #t~ret0; 192800#partsFINAL assume true; 192793#partsEXIT >#64#return; 192782#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192788#$Ultimate##0 ~p := #in~p;~q := #in~q; 193165#L20 assume !(~p <= 0); 193161#L21 assume !(~q <= 0); 193157#L22 assume !(~q > ~p); 192819#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192820#$Ultimate##0 ~p := #in~p;~q := #in~q; 192944#L20 assume !(~p <= 0); 192943#L21 assume !(~q <= 0); 192942#L22 assume !(~q > ~p); 192933#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192940#$Ultimate##0 ~p := #in~p;~q := #in~q; 192958#L20 assume !(~p <= 0); 192952#L21 assume !(~q <= 0); 192953#L22 assume !(~q > ~p); 192956#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192957#$Ultimate##0 ~p := #in~p;~q := #in~q; 192962#L20 assume ~p <= 0;#res := 1; 192960#partsFINAL assume true; 192955#partsEXIT >#64#return; 192950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192951#$Ultimate##0 ~p := #in~p;~q := #in~q; 192961#L20 assume !(~p <= 0); 192959#L21 assume ~q <= 0;#res := 0; 192954#partsFINAL assume true; 192949#partsEXIT >#66#return; 192835#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192947#partsFINAL assume true; 192939#partsEXIT >#64#return; 192834#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192836#$Ultimate##0 ~p := #in~p;~q := #in~q; 192946#L20 assume !(~p <= 0); 192938#L21 assume ~q <= 0;#res := 0; 192932#partsFINAL assume true; 192832#partsEXIT >#66#return; 192828#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192824#partsFINAL assume true; 192818#partsEXIT >#64#return; 192804#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192805#$Ultimate##0 ~p := #in~p;~q := #in~q; 192817#L20 assume !(~p <= 0); 192816#L21 assume ~q <= 0;#res := 0; 192815#partsFINAL assume true; 192803#partsEXIT >#66#return; 192799#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192791#partsFINAL assume true; 192779#partsEXIT >#66#return; 192773#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192771#partsFINAL assume true; 192759#partsEXIT >#66#return; 192754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 192752#partsFINAL assume true; 192740#partsEXIT >#68#return; 192744#L36-1 havoc main_#t~ret8#1; 192497#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 192498#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191594#L36 [2023-02-15 23:15:47,093 INFO L750 eck$LassoCheckResult]: Loop: 191594#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 191601#$Ultimate##0 ~p := #in~p;~q := #in~q; 193066#L20 assume !(~p <= 0); 193065#L21 assume !(~q <= 0); 193062#L22 assume ~q > ~p; 192768#L22-1 call #t~ret0 := parts(~p, ~p);< 192769#$Ultimate##0 ~p := #in~p;~q := #in~q; 193116#L20 assume !(~p <= 0); 193115#L21 assume !(~q <= 0); 193114#L22 assume !(~q > ~p); 193104#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193105#$Ultimate##0 ~p := #in~p;~q := #in~q; 193113#L20 assume ~p <= 0;#res := 1; 193112#partsFINAL assume true; 193103#partsEXIT >#64#return; 193007#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193098#$Ultimate##0 ~p := #in~p;~q := #in~q; 193095#L20 assume !(~p <= 0); 193094#L21 assume !(~q <= 0); 193092#L22 assume !(~q > ~p); 193004#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193005#$Ultimate##0 ~p := #in~p;~q := #in~q; 193093#L20 assume !(~p <= 0); 193091#L21 assume !(~q <= 0); 193089#L22 assume ~q > ~p; 193020#L22-1 call #t~ret0 := parts(~p, ~p);< 193021#$Ultimate##0 ~p := #in~p;~q := #in~q; 193084#L20 assume !(~p <= 0); 193083#L21 assume !(~q <= 0); 193081#L22 assume !(~q > ~p); 193078#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193079#$Ultimate##0 ~p := #in~p;~q := #in~q; 193087#L20 assume ~p <= 0;#res := 1; 193085#partsFINAL assume true; 193077#partsEXIT >#64#return; 193074#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193075#$Ultimate##0 ~p := #in~p;~q := #in~q; 193090#L20 assume !(~p <= 0); 193088#L21 assume ~q <= 0;#res := 0; 193086#partsFINAL assume true; 193073#partsEXIT >#66#return; 193051#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193046#partsFINAL assume true; 193019#partsEXIT >#62#return; 193012#L22-2 #res := #t~ret0;havoc #t~ret0; 193006#partsFINAL assume true; 193001#partsEXIT >#64#return; 192995#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192999#$Ultimate##0 ~p := #in~p;~q := #in~q; 193072#L20 assume !(~p <= 0); 193050#L21 assume !(~q <= 0); 193044#L22 assume !(~q > ~p); 193045#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193097#$Ultimate##0 ~p := #in~p;~q := #in~q; 193126#L20 assume !(~p <= 0); 193125#L21 assume !(~q <= 0); 193123#L22 assume !(~q > ~p); 193118#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193122#$Ultimate##0 ~p := #in~p;~q := #in~q; 193140#L20 assume !(~p <= 0); 193136#L21 assume !(~q <= 0); 193137#L22 assume !(~q > ~p); 193134#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193135#$Ultimate##0 ~p := #in~p;~q := #in~q; 193142#L20 assume ~p <= 0;#res := 1; 193139#partsFINAL assume true; 193133#partsEXIT >#64#return; 193129#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193130#$Ultimate##0 ~p := #in~p;~q := #in~q; 193141#L20 assume !(~p <= 0); 193138#L21 assume ~q <= 0;#res := 0; 193132#partsFINAL assume true; 193128#partsEXIT >#66#return; 193109#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193127#partsFINAL assume true; 193121#partsEXIT >#64#return; 193107#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193110#$Ultimate##0 ~p := #in~p;~q := #in~q; 193124#L20 assume !(~p <= 0); 193120#L21 assume ~q <= 0;#res := 0; 193117#partsFINAL assume true; 193106#partsEXIT >#66#return; 193101#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193099#partsFINAL assume true; 193096#partsEXIT >#64#return; 193025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193026#$Ultimate##0 ~p := #in~p;~q := #in~q; 193037#L20 assume !(~p <= 0); 193035#L21 assume ~q <= 0;#res := 0; 193029#partsFINAL assume true; 193024#partsEXIT >#66#return; 193023#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193014#partsFINAL assume true; 193009#partsEXIT >#66#return; 192998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193150#partsFINAL assume true; 193149#partsEXIT >#66#return; 193148#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 193147#partsFINAL assume true; 192767#partsEXIT >#62#return; 192757#L22-2 #res := #t~ret0;havoc #t~ret0; 192753#partsFINAL assume true; 192746#partsEXIT >#68#return; 192737#L36-1 havoc main_#t~ret8#1; 192738#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 191795#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 191594#L36 [2023-02-15 23:15:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1801387076, now seen corresponding path program 12 times [2023-02-15 23:15:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737657053] [2023-02-15 23:15:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:15:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:15:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:15:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:15:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 23:15:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-15 23:15:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-02-15 23:15:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-15 23:15:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-02-15 23:15:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-02-15 23:15:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-02-15 23:15:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-02-15 23:15:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-02-15 23:15:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2023-02-15 23:15:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-02-15 23:15:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-02-15 23:15:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2023-02-15 23:15:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2023-02-15 23:15:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2023-02-15 23:15:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2023-02-15 23:15:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2023-02-15 23:15:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2023-02-15 23:15:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 721 [2023-02-15 23:15:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:15:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:15:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:15:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:15:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32349 backedges. 636 proven. 858 refuted. 0 times theorem prover too weak. 30855 trivial. 0 not checked. [2023-02-15 23:15:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:15:47,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737657053] [2023-02-15 23:15:47,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737657053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:15:47,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589467017] [2023-02-15 23:15:47,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:15:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:15:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:47,762 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:15:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2023-02-15 23:15:48,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2023-02-15 23:15:48,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:15:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 23:15:48,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 32349 backedges. 2625 proven. 1627 refuted. 0 times theorem prover too weak. 28097 trivial. 0 not checked. [2023-02-15 23:15:48,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:15:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32349 backedges. 2621 proven. 1646 refuted. 0 times theorem prover too weak. 28082 trivial. 0 not checked. [2023-02-15 23:15:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589467017] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:15:49,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:15:49,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 21] total 35 [2023-02-15 23:15:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440284653] [2023-02-15 23:15:49,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:15:49,673 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 23:15:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2124724466, now seen corresponding path program 3 times [2023-02-15 23:15:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:15:49,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3283791] [2023-02-15 23:15:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:15:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:15:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:49,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:15:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:15:49,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:15:50,730 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:50,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:50,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:50,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:50,730 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:15:50,730 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,730 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:50,730 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:50,730 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2023-02-15 23:15:50,730 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:50,730 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:50,730 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:50,758 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:15:50,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:50,760 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:50,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-02-15 23:15:50,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:15:50,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:50,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-02-15 23:15:50,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:50,789 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:50,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-02-15 23:15:50,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:15:50,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:15:50,913 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:15:50,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:50,917 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:15:50,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:15:50,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:15:50,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:15:50,917 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:15:50,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:15:50,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:15:50,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration26_Loop [2023-02-15 23:15:50,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:15:50,917 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:15:50,918 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,925 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,926 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:15:50,946 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:15:50,946 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:15:50,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:50,947 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:50,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-02-15 23:15:50,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:15:50,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:15:50,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:15:50,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:15:50,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:15:50,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:15:50,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:15:50,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:15:50,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:15:50,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 23:15:50,974 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 23:15:50,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:15:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:15:50,977 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:15:50,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-02-15 23:15:50,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:15:50,978 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:15:50,979 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:15:50,979 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-15 23:15:50,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-02-15 23:15:50,982 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:15:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:51,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 5141 conjuncts, 224 conjunts are in the unsatisfiable core [2023-02-15 23:15:51,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:52,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-02-15 23:15:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:54,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:15:54,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:15:55,113 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:15:55,113 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:55,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2147 states and 2475 transitions. Complement of second has 9 states. [2023-02-15 23:15:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:15:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 819 letters. Loop has 106 letters. [2023-02-15 23:15:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:55,133 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:55,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 5141 conjuncts, 224 conjunts are in the unsatisfiable core [2023-02-15 23:15:55,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:58,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:15:58,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:15:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:15:58,910 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:15:58,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:58,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2147 states and 2475 transitions. Complement of second has 9 states. [2023-02-15 23:15:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:15:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:15:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:15:58,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 819 letters. Loop has 106 letters. [2023-02-15 23:15:58,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:15:58,932 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:15:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:15:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:15:59,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 5141 conjuncts, 224 conjunts are in the unsatisfiable core [2023-02-15 23:15:59,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:02,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:16:02,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:16:02,889 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:16:02,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:02,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2107 states and 2432 transitions. cyclomatic complexity: 354. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 4144 states and 4771 transitions. Complement of second has 10 states. [2023-02-15 23:16:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:16:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2023-02-15 23:16:02,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 819 letters. Loop has 106 letters. [2023-02-15 23:16:02,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:02,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 925 letters. Loop has 106 letters. [2023-02-15 23:16:02,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:02,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 819 letters. Loop has 212 letters. [2023-02-15 23:16:02,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:02,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4144 states and 4771 transitions. [2023-02-15 23:16:02,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2023-02-15 23:16:02,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4144 states to 2107 states and 2432 transitions. [2023-02-15 23:16:02,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-15 23:16:02,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2023-02-15 23:16:02,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2107 states and 2432 transitions. [2023-02-15 23:16:02,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:16:02,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2107 states and 2432 transitions. [2023-02-15 23:16:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states and 2432 transitions. [2023-02-15 23:16:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2107. [2023-02-15 23:16:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1469 states have (on average 1.0442477876106195) internal successors, (1534), 1494 states have internal predecessors, (1534), 358 states have call successors, (366), 239 states have call predecessors, (366), 280 states have return successors, (532), 373 states have call predecessors, (532), 358 states have call successors, (532) [2023-02-15 23:16:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2432 transitions. [2023-02-15 23:16:03,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2107 states and 2432 transitions. [2023-02-15 23:16:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:16:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 23:16:03,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 23:16:03,016 INFO L87 Difference]: Start difference. First operand 2107 states and 2432 transitions. Second operand has 35 states, 30 states have (on average 3.8) internal successors, (114), 31 states have internal predecessors, (114), 23 states have call successors, (32), 1 states have call predecessors, (32), 6 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2023-02-15 23:16:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:16:03,993 INFO L93 Difference]: Finished difference Result 1978 states and 2156 transitions. [2023-02-15 23:16:03,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1978 states and 2156 transitions. [2023-02-15 23:16:03,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:16:04,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1978 states to 1320 states and 1407 transitions. [2023-02-15 23:16:04,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2023-02-15 23:16:04,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2023-02-15 23:16:04,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1320 states and 1407 transitions. [2023-02-15 23:16:04,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:16:04,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1320 states and 1407 transitions. [2023-02-15 23:16:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states and 1407 transitions. [2023-02-15 23:16:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1190. [2023-02-15 23:16:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 856 states have (on average 1.0128504672897196) internal successors, (867), 864 states have internal predecessors, (867), 180 states have call successors, (185), 152 states have call predecessors, (185), 154 states have return successors, (193), 173 states have call predecessors, (193), 180 states have call successors, (193) [2023-02-15 23:16:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1245 transitions. [2023-02-15 23:16:04,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1190 states and 1245 transitions. [2023-02-15 23:16:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-02-15 23:16:04,012 INFO L428 stractBuchiCegarLoop]: Abstraction has 1190 states and 1245 transitions. [2023-02-15 23:16:04,012 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-02-15 23:16:04,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1190 states and 1245 transitions. [2023-02-15 23:16:04,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:16:04,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:16:04,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:16:04,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [112, 112, 83, 50, 39, 39, 39, 39, 39, 39, 33, 29, 24, 23, 23, 23, 23, 11, 11, 11, 11, 4, 3, 3, 1, 1, 1, 1] [2023-02-15 23:16:04,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 8, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-15 23:16:04,016 INFO L748 eck$LassoCheckResult]: Stem: 221588#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 221557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 221558#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 221551#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 221552#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 221602#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222045#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222046#$Ultimate##0 ~p := #in~p;~q := #in~q; 222049#L20 assume ~p <= 0;#res := 1; 222048#partsFINAL assume true; 222044#partsEXIT >#68#return; 222041#L36-1 havoc main_#t~ret8#1; 222038#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222034#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222026#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222027#$Ultimate##0 ~p := #in~p;~q := #in~q; 222032#L20 assume ~p <= 0;#res := 1; 222031#partsFINAL assume true; 222025#partsEXIT >#68#return; 222024#L36-1 havoc main_#t~ret8#1; 222023#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222021#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222018#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222019#$Ultimate##0 ~p := #in~p;~q := #in~q; 222029#L20 assume ~p <= 0;#res := 1; 222028#partsFINAL assume true; 222017#partsEXIT >#68#return; 222016#L36-1 havoc main_#t~ret8#1; 222015#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222013#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222009#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221897#$Ultimate##0 ~p := #in~p;~q := #in~q; 222014#L20 assume ~p <= 0;#res := 1; 222012#partsFINAL assume true; 222008#partsEXIT >#68#return; 222011#L36-1 havoc main_#t~ret8#1; 222033#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222030#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222010#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221897#$Ultimate##0 ~p := #in~p;~q := #in~q; 222014#L20 assume ~p <= 0;#res := 1; 222012#partsFINAL assume true; 222008#partsEXIT >#68#return; 222007#L36-1 havoc main_#t~ret8#1; 222004#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222001#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221896#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221898#$Ultimate##0 ~p := #in~p;~q := #in~q; 221999#L20 assume ~p <= 0;#res := 1; 221998#partsFINAL assume true; 221895#partsEXIT >#68#return; 221893#L36-1 havoc main_#t~ret8#1; 221887#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221883#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 221565#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 221566#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 221603#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221978#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221979#$Ultimate##0 ~p := #in~p;~q := #in~q; 221991#L20 assume !(~p <= 0); 221990#L21 assume ~q <= 0;#res := 0; 221989#partsFINAL assume true; 221977#partsEXIT >#68#return; 221975#L36-1 havoc main_#t~ret8#1; 221974#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221973#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221971#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221972#$Ultimate##0 ~p := #in~p;~q := #in~q; 222091#L20 assume !(~p <= 0); 222090#L21 assume !(~q <= 0); 222088#L22 assume !(~q > ~p); 222085#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222086#$Ultimate##0 ~p := #in~p;~q := #in~q; 222089#L20 assume ~p <= 0;#res := 1; 222087#partsFINAL assume true; 222084#partsEXIT >#64#return; 221982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221983#$Ultimate##0 ~p := #in~p;~q := #in~q; 221988#L20 assume !(~p <= 0); 221987#L21 assume ~q <= 0;#res := 0; 221986#partsFINAL assume true; 221981#partsEXIT >#66#return; 221980#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221976#partsFINAL assume true; 221970#partsEXIT >#68#return; 221968#L36-1 havoc main_#t~ret8#1; 221966#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221964#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221951#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221957#$Ultimate##0 ~p := #in~p;~q := #in~q; 221955#L20 assume !(~p <= 0); 221954#L21 assume !(~q <= 0); 221953#L22 assume ~q > ~p; 221944#L22-1 call #t~ret0 := parts(~p, ~p);< 221947#$Ultimate##0 ~p := #in~p;~q := #in~q; 221969#L20 assume !(~p <= 0); 221967#L21 assume !(~q <= 0); 221965#L22 assume !(~q > ~p); 221962#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221963#$Ultimate##0 ~p := #in~p;~q := #in~q; 221993#L20 assume ~p <= 0;#res := 1; 221992#partsFINAL assume true; 221961#partsEXIT >#64#return; 221959#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221960#$Ultimate##0 ~p := #in~p;~q := #in~q; 222003#L20 assume !(~p <= 0); 222000#L21 assume ~q <= 0;#res := 0; 221994#partsFINAL assume true; 221958#partsEXIT >#66#return; 221956#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221950#partsFINAL assume true; 221943#partsEXIT >#62#return; 221946#L22-2 #res := #t~ret0;havoc #t~ret0; 222078#partsFINAL assume true; 222071#partsEXIT >#68#return; 222066#L36-1 havoc main_#t~ret8#1; 222063#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222060#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221909#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221901#$Ultimate##0 ~p := #in~p;~q := #in~q; 221952#L20 assume !(~p <= 0); 221949#L21 assume !(~q <= 0); 221948#L22 assume ~q > ~p; 221945#L22-1 call #t~ret0 := parts(~p, ~p);< 221947#$Ultimate##0 ~p := #in~p;~q := #in~q; 221969#L20 assume !(~p <= 0); 221967#L21 assume !(~q <= 0); 221965#L22 assume !(~q > ~p); 221962#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221963#$Ultimate##0 ~p := #in~p;~q := #in~q; 221993#L20 assume ~p <= 0;#res := 1; 221992#partsFINAL assume true; 221961#partsEXIT >#64#return; 221959#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221960#$Ultimate##0 ~p := #in~p;~q := #in~q; 222003#L20 assume !(~p <= 0); 222000#L21 assume ~q <= 0;#res := 0; 221994#partsFINAL assume true; 221958#partsEXIT >#66#return; 221956#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221950#partsFINAL assume true; 221943#partsEXIT >#62#return; 221942#L22-2 #res := #t~ret0;havoc #t~ret0; 221940#partsFINAL assume true; 221908#partsEXIT >#68#return; 221911#L36-1 havoc main_#t~ret8#1; 221917#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221915#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221910#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221901#$Ultimate##0 ~p := #in~p;~q := #in~q; 221952#L20 assume !(~p <= 0); 221949#L21 assume !(~q <= 0); 221948#L22 assume ~q > ~p; 221945#L22-1 call #t~ret0 := parts(~p, ~p);< 221947#$Ultimate##0 ~p := #in~p;~q := #in~q; 221969#L20 assume !(~p <= 0); 221967#L21 assume !(~q <= 0); 221965#L22 assume !(~q > ~p); 221962#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221963#$Ultimate##0 ~p := #in~p;~q := #in~q; 221993#L20 assume ~p <= 0;#res := 1; 221992#partsFINAL assume true; 221961#partsEXIT >#64#return; 221959#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221960#$Ultimate##0 ~p := #in~p;~q := #in~q; 222003#L20 assume !(~p <= 0); 222000#L21 assume ~q <= 0;#res := 0; 221994#partsFINAL assume true; 221958#partsEXIT >#66#return; 221956#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221950#partsFINAL assume true; 221943#partsEXIT >#62#return; 221942#L22-2 #res := #t~ret0;havoc #t~ret0; 221940#partsFINAL assume true; 221908#partsEXIT >#68#return; 221906#L36-1 havoc main_#t~ret8#1; 221904#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221903#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221900#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221902#$Ultimate##0 ~p := #in~p;~q := #in~q; 222054#L20 assume !(~p <= 0); 222051#L21 assume !(~q <= 0); 222050#L22 assume ~q > ~p; 221913#L22-1 call #t~ret0 := parts(~p, ~p);< 221914#$Ultimate##0 ~p := #in~p;~q := #in~q; 221936#L20 assume !(~p <= 0); 221934#L21 assume !(~q <= 0); 221933#L22 assume !(~q > ~p); 221931#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221932#$Ultimate##0 ~p := #in~p;~q := #in~q; 221937#L20 assume ~p <= 0;#res := 1; 221935#partsFINAL assume true; 221930#partsEXIT >#64#return; 221928#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221929#$Ultimate##0 ~p := #in~p;~q := #in~q; 221941#L20 assume !(~p <= 0); 221939#L21 assume ~q <= 0;#res := 0; 221938#partsFINAL assume true; 221927#partsEXIT >#66#return; 221926#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221924#partsFINAL assume true; 221912#partsEXIT >#62#return; 221907#L22-2 #res := #t~ret0;havoc #t~ret0; 221905#partsFINAL assume true; 221899#partsEXIT >#68#return; 221889#L36-1 havoc main_#t~ret8#1; 221885#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221881#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 221877#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 221827#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 221823#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221818#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221819#$Ultimate##0 ~p := #in~p;~q := #in~q; 221842#L20 assume !(~p <= 0); 221841#L21 assume ~q <= 0;#res := 0; 221840#partsFINAL assume true; 221817#partsEXIT >#68#return; 221815#L36-1 havoc main_#t~ret8#1; 221814#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221813#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221805#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221808#$Ultimate##0 ~p := #in~p;~q := #in~q; 222471#L20 assume !(~p <= 0); 222469#L21 assume !(~q <= 0); 222438#L22 assume !(~q > ~p); 221825#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221826#$Ultimate##0 ~p := #in~p;~q := #in~q; 222463#L20 assume !(~p <= 0); 222457#L21 assume !(~q <= 0); 222451#L22 assume !(~q > ~p); 222446#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222447#$Ultimate##0 ~p := #in~p;~q := #in~q; 222449#L20 assume ~p <= 0;#res := 1; 222448#partsFINAL assume true; 222445#partsEXIT >#64#return; 221862#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221863#$Ultimate##0 ~p := #in~p;~q := #in~q; 222460#L20 assume !(~p <= 0); 222454#L21 assume ~q <= 0;#res := 0; 222442#partsFINAL assume true; 221861#partsEXIT >#66#return; 221857#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221852#partsFINAL assume true; 221824#partsEXIT >#64#return; 221821#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221822#$Ultimate##0 ~p := #in~p;~q := #in~q; 221860#L20 assume !(~p <= 0); 221856#L21 assume ~q <= 0;#res := 0; 221851#partsFINAL assume true; 221820#partsEXIT >#66#return; 221816#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221811#partsFINAL assume true; 221804#partsEXIT >#68#return; 221807#L36-1 havoc main_#t~ret8#1; 222551#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222552#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221798#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222603#$Ultimate##0 ~p := #in~p;~q := #in~q; 222623#L20 assume !(~p <= 0); 222620#L21 assume !(~q <= 0); 222618#L22 assume !(~q > ~p); 222615#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222616#$Ultimate##0 ~p := #in~p;~q := #in~q; 222631#L20 assume ~p <= 0;#res := 1; 222627#partsFINAL assume true; 222614#partsEXIT >#64#return; 222609#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222610#$Ultimate##0 ~p := #in~p;~q := #in~q; 222653#L20 assume !(~p <= 0); 222652#L21 assume !(~q <= 0); 222651#L22 assume !(~q > ~p); 222629#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222630#$Ultimate##0 ~p := #in~p;~q := #in~q; 222656#L20 assume !(~p <= 0); 222655#L21 assume !(~q <= 0); 222654#L22 assume !(~q > ~p); 222641#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222642#$Ultimate##0 ~p := #in~p;~q := #in~q; 222645#L20 assume ~p <= 0;#res := 1; 222643#partsFINAL assume true; 222640#partsEXIT >#64#return; 222638#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222639#$Ultimate##0 ~p := #in~p;~q := #in~q; 222647#L20 assume !(~p <= 0); 222646#L21 assume ~q <= 0;#res := 0; 222644#partsFINAL assume true; 222637#partsEXIT >#66#return; 222636#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222634#partsFINAL assume true; 222628#partsEXIT >#64#return; 222625#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222626#$Ultimate##0 ~p := #in~p;~q := #in~q; 222650#L20 assume !(~p <= 0); 222649#L21 assume ~q <= 0;#res := 0; 222648#partsFINAL assume true; 222624#partsEXIT >#66#return; 222613#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222612#partsFINAL assume true; 222608#partsEXIT >#66#return; 222606#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222604#partsFINAL assume true; 222601#partsEXIT >#68#return; 222599#L36-1 havoc main_#t~ret8#1; 222597#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222092#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221736#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221615#$Ultimate##0 ~p := #in~p;~q := #in~q; 221751#L20 assume !(~p <= 0); 221747#L21 assume !(~q <= 0); 221745#L22 assume ~q > ~p; 221742#L22-1 call #t~ret0 := parts(~p, ~p);< 221743#$Ultimate##0 ~p := #in~p;~q := #in~q; 221770#L20 assume !(~p <= 0); 221763#L21 assume !(~q <= 0); 221758#L22 assume !(~q > ~p); 221754#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221755#$Ultimate##0 ~p := #in~p;~q := #in~q; 221762#L20 assume ~p <= 0;#res := 1; 221757#partsFINAL assume true; 221753#partsEXIT >#64#return; 221749#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221750#$Ultimate##0 ~p := #in~p;~q := #in~q; 221812#L20 assume !(~p <= 0); 221810#L21 assume !(~q <= 0); 221809#L22 assume !(~q > ~p); 221766#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221769#$Ultimate##0 ~p := #in~p;~q := #in~q; 221839#L20 assume !(~p <= 0); 221838#L21 assume !(~q <= 0); 221834#L22 assume !(~q > ~p); 221831#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221832#$Ultimate##0 ~p := #in~p;~q := #in~q; 221847#L20 assume ~p <= 0;#res := 1; 221846#partsFINAL assume true; 221830#partsEXIT >#64#return; 221781#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221782#$Ultimate##0 ~p := #in~p;~q := #in~q; 221985#L20 assume !(~p <= 0); 221984#L21 assume ~q <= 0;#res := 0; 221828#partsFINAL assume true; 221780#partsEXIT >#66#return; 221778#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221772#partsFINAL assume true; 221765#partsEXIT >#64#return; 221760#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221761#$Ultimate##0 ~p := #in~p;~q := #in~q; 221774#L20 assume !(~p <= 0); 221771#L21 assume ~q <= 0;#res := 0; 221764#partsFINAL assume true; 221759#partsEXIT >#66#return; 221756#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221752#partsFINAL assume true; 221748#partsEXIT >#66#return; 221746#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221744#partsFINAL assume true; 221741#partsEXIT >#62#return; 221740#L22-2 #res := #t~ret0;havoc #t~ret0; 221739#partsFINAL assume true; 221735#partsEXIT >#68#return; 221738#L36-1 havoc main_#t~ret8#1; 222098#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222093#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221737#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221615#$Ultimate##0 ~p := #in~p;~q := #in~q; 221751#L20 assume !(~p <= 0); 221747#L21 assume !(~q <= 0); 221745#L22 assume ~q > ~p; 221742#L22-1 call #t~ret0 := parts(~p, ~p);< 221743#$Ultimate##0 ~p := #in~p;~q := #in~q; 221770#L20 assume !(~p <= 0); 221763#L21 assume !(~q <= 0); 221758#L22 assume !(~q > ~p); 221754#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221755#$Ultimate##0 ~p := #in~p;~q := #in~q; 221762#L20 assume ~p <= 0;#res := 1; 221757#partsFINAL assume true; 221753#partsEXIT >#64#return; 221749#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221750#$Ultimate##0 ~p := #in~p;~q := #in~q; 221812#L20 assume !(~p <= 0); 221810#L21 assume !(~q <= 0); 221809#L22 assume !(~q > ~p); 221766#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221769#$Ultimate##0 ~p := #in~p;~q := #in~q; 221839#L20 assume !(~p <= 0); 221838#L21 assume !(~q <= 0); 221834#L22 assume !(~q > ~p); 221831#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221832#$Ultimate##0 ~p := #in~p;~q := #in~q; 221847#L20 assume ~p <= 0;#res := 1; 221846#partsFINAL assume true; 221830#partsEXIT >#64#return; 221781#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221782#$Ultimate##0 ~p := #in~p;~q := #in~q; 221985#L20 assume !(~p <= 0); 221984#L21 assume ~q <= 0;#res := 0; 221828#partsFINAL assume true; 221780#partsEXIT >#66#return; 221778#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221772#partsFINAL assume true; 221765#partsEXIT >#64#return; 221760#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221761#$Ultimate##0 ~p := #in~p;~q := #in~q; 221774#L20 assume !(~p <= 0); 221771#L21 assume ~q <= 0;#res := 0; 221764#partsFINAL assume true; 221759#partsEXIT >#66#return; 221756#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221752#partsFINAL assume true; 221748#partsEXIT >#66#return; 221746#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221744#partsFINAL assume true; 221741#partsEXIT >#62#return; 221740#L22-2 #res := #t~ret0;havoc #t~ret0; 221739#partsFINAL assume true; 221735#partsEXIT >#68#return; 221732#L36-1 havoc main_#t~ret8#1; 221730#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221729#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221605#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221614#$Ultimate##0 ~p := #in~p;~q := #in~q; 221610#L20 assume !(~p <= 0); 221609#L21 assume !(~q <= 0); 221604#L22 assume ~q > ~p; 221606#L22-1 call #t~ret0 := parts(~p, ~p);< 221647#$Ultimate##0 ~p := #in~p;~q := #in~q; 221645#L20 assume !(~p <= 0); 221643#L21 assume !(~q <= 0); 221641#L22 assume !(~q > ~p); 221632#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221633#$Ultimate##0 ~p := #in~p;~q := #in~q; 221640#L20 assume ~p <= 0;#res := 1; 221639#partsFINAL assume true; 221631#partsEXIT >#64#return; 221623#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221627#$Ultimate##0 ~p := #in~p;~q := #in~q; 221708#L20 assume !(~p <= 0); 221705#L21 assume !(~q <= 0); 221685#L22 assume !(~q > ~p); 221664#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221665#$Ultimate##0 ~p := #in~p;~q := #in~q; 221700#L20 assume !(~p <= 0); 221699#L21 assume !(~q <= 0); 221698#L22 assume !(~q > ~p); 221696#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221560#$Ultimate##0 ~p := #in~p;~q := #in~q; 221704#L20 assume ~p <= 0;#res := 1; 221703#partsFINAL assume true; 221695#partsEXIT >#64#return; 221692#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221693#$Ultimate##0 ~p := #in~p;~q := #in~q; 221716#L20 assume !(~p <= 0); 221711#L21 assume ~q <= 0;#res := 0; 221707#partsFINAL assume true; 221691#partsEXIT >#66#return; 221689#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221683#partsFINAL assume true; 221663#partsEXIT >#64#return; 221650#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221651#$Ultimate##0 ~p := #in~p;~q := #in~q; 221678#L20 assume !(~p <= 0); 221662#L21 assume ~q <= 0;#res := 0; 221658#partsFINAL assume true; 221649#partsEXIT >#66#return; 221637#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221629#partsFINAL assume true; 221622#partsEXIT >#66#return; 221620#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 221621#partsFINAL assume true; 221611#partsEXIT >#62#return; 221612#L22-2 #res := #t~ret0;havoc #t~ret0; 221618#partsFINAL assume true; 221619#partsEXIT >#68#return; 222489#L36-1 havoc main_#t~ret8#1; 222486#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222482#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 221563#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 221564#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 221607#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221608#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222174#$Ultimate##0 ~p := #in~p;~q := #in~q; 222215#L20 assume !(~p <= 0); 222213#L21 assume ~q <= 0;#res := 0; 222211#partsFINAL assume true; 222173#partsEXIT >#68#return; 222171#L36-1 havoc main_#t~ret8#1; 222169#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222168#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222156#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222157#$Ultimate##0 ~p := #in~p;~q := #in~q; 222286#L20 assume !(~p <= 0); 222285#L21 assume !(~q <= 0); 222284#L22 assume !(~q > ~p); 222188#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222283#$Ultimate##0 ~p := #in~p;~q := #in~q; 222307#L20 assume !(~p <= 0); 222305#L21 assume !(~q <= 0); 222303#L22 assume !(~q > ~p); 222209#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222210#$Ultimate##0 ~p := #in~p;~q := #in~q; 222281#L20 assume !(~p <= 0); 222279#L21 assume !(~q <= 0); 222276#L22 assume !(~q > ~p); 222277#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222317#$Ultimate##0 ~p := #in~p;~q := #in~q; 222323#L20 assume ~p <= 0;#res := 1; 222320#partsFINAL assume true; 222316#partsEXIT >#64#return; 222314#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222315#$Ultimate##0 ~p := #in~p;~q := #in~q; 222324#L20 assume !(~p <= 0); 222321#L21 assume ~q <= 0;#res := 0; 222318#partsFINAL assume true; 222313#partsEXIT >#66#return; 222312#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222301#partsFINAL assume true; 222298#partsEXIT >#64#return; 222293#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222294#$Ultimate##0 ~p := #in~p;~q := #in~q; 222310#L20 assume !(~p <= 0); 222300#L21 assume ~q <= 0;#res := 0; 222297#partsFINAL assume true; 222291#partsEXIT >#66#return; 222289#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222287#partsFINAL assume true; 222282#partsEXIT >#64#return; 222177#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222180#$Ultimate##0 ~p := #in~p;~q := #in~q; 222266#L20 assume !(~p <= 0); 222262#L21 assume ~q <= 0;#res := 0; 222184#partsFINAL assume true; 222176#partsEXIT >#66#return; 222159#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222158#partsFINAL assume true; 222155#partsEXIT >#68#return; 222153#L36-1 havoc main_#t~ret8#1; 222147#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222132#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222133#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222472#$Ultimate##0 ~p := #in~p;~q := #in~q; 222470#L20 assume !(~p <= 0); 222468#L21 assume !(~q <= 0); 222466#L22 assume !(~q > ~p); 221595#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222507#$Ultimate##0 ~p := #in~p;~q := #in~q; 222452#L20 assume !(~p <= 0); 222453#L21 assume !(~q <= 0); 222440#L22 assume ~q > ~p; 222441#L22-1 call #t~ret0 := parts(~p, ~p);< 222521#$Ultimate##0 ~p := #in~p;~q := #in~q; 222532#L20 assume !(~p <= 0); 222531#L21 assume !(~q <= 0); 222530#L22 assume !(~q > ~p); 222528#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222529#$Ultimate##0 ~p := #in~p;~q := #in~q; 222534#L20 assume ~p <= 0;#res := 1; 222533#partsFINAL assume true; 222527#partsEXIT >#64#return; 222525#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222526#$Ultimate##0 ~p := #in~p;~q := #in~q; 222537#L20 assume !(~p <= 0); 222536#L21 assume ~q <= 0;#res := 0; 222535#partsFINAL assume true; 222524#partsEXIT >#66#return; 222523#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222522#partsFINAL assume true; 222520#partsEXIT >#62#return; 221594#L22-2 #res := #t~ret0;havoc #t~ret0; 221596#partsFINAL assume true; 222506#partsEXIT >#64#return; 222502#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222504#$Ultimate##0 ~p := #in~p;~q := #in~q; 222596#L20 assume !(~p <= 0); 222549#L21 assume !(~q <= 0); 222548#L22 assume !(~q > ~p); 222546#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222547#$Ultimate##0 ~p := #in~p;~q := #in~q; 222566#L20 assume !(~p <= 0); 222565#L21 assume !(~q <= 0); 222564#L22 assume !(~q > ~p); 222562#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222563#$Ultimate##0 ~p := #in~p;~q := #in~q; 222594#L20 assume !(~p <= 0); 222592#L21 assume !(~q <= 0); 222593#L22 assume !(~q > ~p); 222674#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222675#$Ultimate##0 ~p := #in~p;~q := #in~q; 222679#L20 assume ~p <= 0;#res := 1; 222677#partsFINAL assume true; 222673#partsEXIT >#64#return; 222670#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222671#$Ultimate##0 ~p := #in~p;~q := #in~q; 222678#L20 assume !(~p <= 0); 222676#L21 assume ~q <= 0;#res := 0; 222672#partsFINAL assume true; 222669#partsEXIT >#66#return; 222558#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222667#partsFINAL assume true; 222560#partsEXIT >#64#return; 222556#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222559#$Ultimate##0 ~p := #in~p;~q := #in~q; 222583#L20 assume !(~p <= 0); 222575#L21 assume ~q <= 0;#res := 0; 222569#partsFINAL assume true; 222555#partsEXIT >#66#return; 222554#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222550#partsFINAL assume true; 222545#partsEXIT >#64#return; 222511#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222512#$Ultimate##0 ~p := #in~p;~q := #in~q; 222519#L20 assume !(~p <= 0); 222518#L21 assume ~q <= 0;#res := 0; 222517#partsFINAL assume true; 222510#partsEXIT >#66#return; 222508#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222505#partsFINAL assume true; 222500#partsEXIT >#66#return; 222499#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222498#partsFINAL assume true; 222497#partsEXIT >#68#return; 222496#L36-1 havoc main_#t~ret8#1; 222495#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 222494#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222473#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 222493#$Ultimate##0 ~p := #in~p;~q := #in~q; 222492#L20 assume !(~p <= 0); 222491#L21 assume !(~q <= 0); 222488#L22 assume !(~q > ~p); 222484#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222485#$Ultimate##0 ~p := #in~p;~q := #in~q; 222490#L20 assume ~p <= 0;#res := 1; 222487#partsFINAL assume true; 222483#partsEXIT >#64#return; 222464#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222474#$Ultimate##0 ~p := #in~p;~q := #in~q; 222516#L20 assume !(~p <= 0); 222514#L21 assume !(~q <= 0); 222513#L22 assume !(~q > ~p); 221586#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222458#$Ultimate##0 ~p := #in~p;~q := #in~q; 222459#L20 assume !(~p <= 0); 222443#L21 assume !(~q <= 0); 222444#L22 assume ~q > ~p; 221585#L22-1 call #t~ret0 := parts(~p, ~p);< 221587#$Ultimate##0 ~p := #in~p;~q := #in~q; 222543#L20 assume !(~p <= 0); 222540#L21 assume !(~q <= 0); 222481#L22 assume !(~q > ~p); 222479#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222480#$Ultimate##0 ~p := #in~p;~q := #in~q; 222542#L20 assume ~p <= 0;#res := 1; 222539#partsFINAL assume true; 222478#partsEXIT >#64#return; 222476#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222477#$Ultimate##0 ~p := #in~p;~q := #in~q; 222544#L20 assume !(~p <= 0); 222541#L21 assume ~q <= 0;#res := 0; 222538#partsFINAL assume true; 222475#partsEXIT >#66#return; 222467#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222465#partsFINAL assume true; 222461#partsEXIT >#62#return; 222462#L22-2 #res := #t~ret0;havoc #t~ret0; 222515#partsFINAL assume true; 222509#partsEXIT >#64#return; 222501#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222504#$Ultimate##0 ~p := #in~p;~q := #in~q; 222596#L20 assume !(~p <= 0); 222549#L21 assume !(~q <= 0); 222548#L22 assume !(~q > ~p); 222546#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222547#$Ultimate##0 ~p := #in~p;~q := #in~q; 222566#L20 assume !(~p <= 0); 222565#L21 assume !(~q <= 0); 222564#L22 assume !(~q > ~p); 222562#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222563#$Ultimate##0 ~p := #in~p;~q := #in~q; 222594#L20 assume !(~p <= 0); 222592#L21 assume !(~q <= 0); 222593#L22 assume !(~q > ~p); 222674#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222675#$Ultimate##0 ~p := #in~p;~q := #in~q; 222679#L20 assume ~p <= 0;#res := 1; 222677#partsFINAL assume true; 222673#partsEXIT >#64#return; 222670#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222671#$Ultimate##0 ~p := #in~p;~q := #in~q; 222678#L20 assume !(~p <= 0); 222676#L21 assume ~q <= 0;#res := 0; 222672#partsFINAL assume true; 222669#partsEXIT >#66#return; 222558#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222667#partsFINAL assume true; 222560#partsEXIT >#64#return; 222556#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222559#$Ultimate##0 ~p := #in~p;~q := #in~q; 222583#L20 assume !(~p <= 0); 222575#L21 assume ~q <= 0;#res := 0; 222569#partsFINAL assume true; 222555#partsEXIT >#66#return; 222554#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222550#partsFINAL assume true; 222545#partsEXIT >#64#return; 222511#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222512#$Ultimate##0 ~p := #in~p;~q := #in~q; 222519#L20 assume !(~p <= 0); 222518#L21 assume ~q <= 0;#res := 0; 222517#partsFINAL assume true; 222510#partsEXIT >#66#return; 222508#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222505#partsFINAL assume true; 222500#partsEXIT >#66#return; 222503#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222666#partsFINAL assume true; 222664#partsEXIT >#66#return; 222662#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222660#partsFINAL assume true; 222658#partsEXIT >#68#return; 221601#L36-1 havoc main_#t~ret8#1; 221590#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221591#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 222106#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221657#$Ultimate##0 ~p := #in~p;~q := #in~q; 222129#L20 assume !(~p <= 0); 222120#L21 assume !(~q <= 0); 222116#L22 assume ~q > ~p; 222112#L22-1 call #t~ret0 := parts(~p, ~p);< 222113#$Ultimate##0 ~p := #in~p;~q := #in~q; 222154#L20 assume !(~p <= 0); 222152#L21 assume !(~q <= 0); 222146#L22 assume !(~q > ~p); 222136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222137#$Ultimate##0 ~p := #in~p;~q := #in~q; 222149#L20 assume ~p <= 0;#res := 1; 222148#partsFINAL assume true; 222135#partsEXIT >#64#return; 222127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222128#$Ultimate##0 ~p := #in~p;~q := #in~q; 222181#L20 assume !(~p <= 0); 222175#L21 assume !(~q <= 0); 222172#L22 assume !(~q > ~p); 222165#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222167#$Ultimate##0 ~p := #in~p;~q := #in~q; 222329#L20 assume !(~p <= 0); 222327#L21 assume !(~q <= 0); 222326#L22 assume ~q > ~p; 222204#L22-1 call #t~ret0 := parts(~p, ~p);< 222205#$Ultimate##0 ~p := #in~p;~q := #in~q; 222269#L20 assume !(~p <= 0); 222268#L21 assume !(~q <= 0); 222267#L22 assume !(~q > ~p); 222264#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222265#$Ultimate##0 ~p := #in~p;~q := #in~q; 222271#L20 assume ~p <= 0;#res := 1; 222270#partsFINAL assume true; 222263#partsEXIT >#64#return; 222260#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222261#$Ultimate##0 ~p := #in~p;~q := #in~q; 222275#L20 assume !(~p <= 0); 222273#L21 assume ~q <= 0;#res := 0; 222272#partsFINAL assume true; 222259#partsEXIT >#66#return; 222258#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222257#partsFINAL assume true; 222203#partsEXIT >#62#return; 222197#L22-2 #res := #t~ret0;havoc #t~ret0; 222170#partsFINAL assume true; 222164#partsEXIT >#64#return; 222141#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222151#$Ultimate##0 ~p := #in~p;~q := #in~q; 222216#L20 assume !(~p <= 0); 222214#L21 assume !(~q <= 0); 222212#L22 assume !(~q > ~p); 222192#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222193#$Ultimate##0 ~p := #in~p;~q := #in~q; 222582#L20 assume !(~p <= 0); 222581#L21 assume !(~q <= 0); 222580#L22 assume !(~q > ~p); 222578#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222579#$Ultimate##0 ~p := #in~p;~q := #in~q; 222589#L20 assume !(~p <= 0); 222587#L21 assume !(~q <= 0); 222588#L22 assume !(~q > ~p); 222685#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222686#$Ultimate##0 ~p := #in~p;~q := #in~q; 222690#L20 assume ~p <= 0;#res := 1; 222689#partsFINAL assume true; 222684#partsEXIT >#64#return; 222681#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222682#$Ultimate##0 ~p := #in~p;~q := #in~q; 222688#L20 assume !(~p <= 0); 222687#L21 assume ~q <= 0;#res := 0; 222683#partsFINAL assume true; 222680#partsEXIT >#66#return; 222573#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222668#partsFINAL assume true; 222576#partsEXIT >#64#return; 222571#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222574#$Ultimate##0 ~p := #in~p;~q := #in~q; 222590#L20 assume !(~p <= 0); 222585#L21 assume ~q <= 0;#res := 0; 222584#partsFINAL assume true; 222570#partsEXIT >#66#return; 222568#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222567#partsFINAL assume true; 222191#partsEXIT >#64#return; 222162#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222163#$Ultimate##0 ~p := #in~p;~q := #in~q; 222186#L20 assume !(~p <= 0); 222183#L21 assume ~q <= 0;#res := 0; 222182#partsFINAL assume true; 222161#partsEXIT >#66#return; 222160#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222150#partsFINAL assume true; 222138#partsEXIT >#66#return; 222144#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222134#partsFINAL assume true; 222126#partsEXIT >#66#return; 222119#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222115#partsFINAL assume true; 222111#partsEXIT >#62#return; 222109#L22-2 #res := #t~ret0;havoc #t~ret0; 222108#partsFINAL assume true; 222104#partsEXIT >#68#return; 222099#L36-1 havoc main_#t~ret8#1; 221733#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221731#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221583#L36 [2023-02-15 23:16:04,016 INFO L750 eck$LassoCheckResult]: Loop: 221583#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 221657#$Ultimate##0 ~p := #in~p;~q := #in~q; 222129#L20 assume !(~p <= 0); 222120#L21 assume !(~q <= 0); 222116#L22 assume ~q > ~p; 222112#L22-1 call #t~ret0 := parts(~p, ~p);< 222113#$Ultimate##0 ~p := #in~p;~q := #in~q; 222154#L20 assume !(~p <= 0); 222152#L21 assume !(~q <= 0); 222146#L22 assume !(~q > ~p); 222136#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222137#$Ultimate##0 ~p := #in~p;~q := #in~q; 222149#L20 assume ~p <= 0;#res := 1; 222148#partsFINAL assume true; 222135#partsEXIT >#64#return; 222127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222128#$Ultimate##0 ~p := #in~p;~q := #in~q; 222181#L20 assume !(~p <= 0); 222175#L21 assume !(~q <= 0); 222172#L22 assume !(~q > ~p); 222165#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222167#$Ultimate##0 ~p := #in~p;~q := #in~q; 222329#L20 assume !(~p <= 0); 222327#L21 assume !(~q <= 0); 222326#L22 assume ~q > ~p; 222204#L22-1 call #t~ret0 := parts(~p, ~p);< 222205#$Ultimate##0 ~p := #in~p;~q := #in~q; 222269#L20 assume !(~p <= 0); 222268#L21 assume !(~q <= 0); 222267#L22 assume !(~q > ~p); 222264#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222265#$Ultimate##0 ~p := #in~p;~q := #in~q; 222271#L20 assume ~p <= 0;#res := 1; 222270#partsFINAL assume true; 222263#partsEXIT >#64#return; 222260#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222261#$Ultimate##0 ~p := #in~p;~q := #in~q; 222275#L20 assume !(~p <= 0); 222273#L21 assume ~q <= 0;#res := 0; 222272#partsFINAL assume true; 222259#partsEXIT >#66#return; 222258#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222257#partsFINAL assume true; 222203#partsEXIT >#62#return; 222197#L22-2 #res := #t~ret0;havoc #t~ret0; 222170#partsFINAL assume true; 222164#partsEXIT >#64#return; 222141#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222151#$Ultimate##0 ~p := #in~p;~q := #in~q; 222216#L20 assume !(~p <= 0); 222214#L21 assume !(~q <= 0); 222212#L22 assume !(~q > ~p); 222192#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222193#$Ultimate##0 ~p := #in~p;~q := #in~q; 222582#L20 assume !(~p <= 0); 222581#L21 assume !(~q <= 0); 222580#L22 assume !(~q > ~p); 222578#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222579#$Ultimate##0 ~p := #in~p;~q := #in~q; 222589#L20 assume !(~p <= 0); 222587#L21 assume !(~q <= 0); 222588#L22 assume !(~q > ~p); 222685#L23 call #t~ret1 := parts(~p - ~q, ~q);< 222686#$Ultimate##0 ~p := #in~p;~q := #in~q; 222690#L20 assume ~p <= 0;#res := 1; 222689#partsFINAL assume true; 222684#partsEXIT >#64#return; 222681#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222682#$Ultimate##0 ~p := #in~p;~q := #in~q; 222688#L20 assume !(~p <= 0); 222687#L21 assume ~q <= 0;#res := 0; 222683#partsFINAL assume true; 222680#partsEXIT >#66#return; 222573#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222668#partsFINAL assume true; 222576#partsEXIT >#64#return; 222571#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222574#$Ultimate##0 ~p := #in~p;~q := #in~q; 222590#L20 assume !(~p <= 0); 222585#L21 assume ~q <= 0;#res := 0; 222584#partsFINAL assume true; 222570#partsEXIT >#66#return; 222568#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222567#partsFINAL assume true; 222191#partsEXIT >#64#return; 222162#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 222163#$Ultimate##0 ~p := #in~p;~q := #in~q; 222186#L20 assume !(~p <= 0); 222183#L21 assume ~q <= 0;#res := 0; 222182#partsFINAL assume true; 222161#partsEXIT >#66#return; 222160#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222150#partsFINAL assume true; 222138#partsEXIT >#66#return; 222144#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222134#partsFINAL assume true; 222126#partsEXIT >#66#return; 222119#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 222115#partsFINAL assume true; 222111#partsEXIT >#62#return; 222109#L22-2 #res := #t~ret0;havoc #t~ret0; 222108#partsFINAL assume true; 222104#partsEXIT >#68#return; 222099#L36-1 havoc main_#t~ret8#1; 221733#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 221731#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 221583#L36 [2023-02-15 23:16:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1385637969, now seen corresponding path program 13 times [2023-02-15 23:16:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:16:04,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924773727] [2023-02-15 23:16:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:16:04,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:16:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:04,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:16:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:04,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:16:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2124724466, now seen corresponding path program 4 times [2023-02-15 23:16:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:16:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092233232] [2023-02-15 23:16:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:16:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:16:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:04,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:16:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:04,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:16:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 816352094, now seen corresponding path program 14 times [2023-02-15 23:16:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:16:04,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445921692] [2023-02-15 23:16:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:16:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:16:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:16:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 23:16:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 23:16:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:16:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 23:16:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-02-15 23:16:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-02-15 23:16:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-02-15 23:16:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-02-15 23:16:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-02-15 23:16:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-02-15 23:16:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-02-15 23:16:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-02-15 23:16:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2023-02-15 23:16:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-02-15 23:16:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-02-15 23:16:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2023-02-15 23:16:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2023-02-15 23:16:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2023-02-15 23:16:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2023-02-15 23:16:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2023-02-15 23:16:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2023-02-15 23:16:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 721 [2023-02-15 23:16:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 827 [2023-02-15 23:16:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 42463 backedges. 69 proven. 851 refuted. 0 times theorem prover too weak. 41543 trivial. 0 not checked. [2023-02-15 23:16:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:16:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445921692] [2023-02-15 23:16:05,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445921692] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:16:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819391437] [2023-02-15 23:16:05,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:16:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:16:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:05,065 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:16:05,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2023-02-15 23:16:05,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:16:05,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:16:05,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 2315 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 23:16:05,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 42463 backedges. 383 proven. 537 refuted. 0 times theorem prover too weak. 41543 trivial. 0 not checked. [2023-02-15 23:16:05,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:16:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42463 backedges. 69 proven. 851 refuted. 0 times theorem prover too weak. 41543 trivial. 0 not checked. [2023-02-15 23:16:06,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819391437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:16:06,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:16:06,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2023-02-15 23:16:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258787361] [2023-02-15 23:16:06,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:16:07,297 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:16:07,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:16:07,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:16:07,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:16:07,297 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 23:16:07,298 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,298 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:16:07,298 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:16:07,298 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration27_Loop [2023-02-15 23:16:07,298 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:16:07,298 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:16:07,298 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,299 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,304 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,318 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:16:07,318 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 23:16:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,319 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-02-15 23:16:07,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:16:07,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:16:07,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 23:16:07,331 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 23:16:07,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,335 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-02-15 23:16:07,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 23:16:07,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:16:07,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,350 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-02-15 23:16:07,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 23:16:07,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 23:16:07,512 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 23:16:07,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,516 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 23:16:07,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 23:16:07,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 23:16:07,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 23:16:07,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 23:16:07,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 23:16:07,516 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 23:16:07,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration27_Loop [2023-02-15 23:16:07,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 23:16:07,516 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 23:16:07,517 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,519 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,520 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 23:16:07,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 23:16:07,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 23:16:07,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,551 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-02-15 23:16:07,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:16:07,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:16:07,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:16:07,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:16:07,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:16:07,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:16:07,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:16:07,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:16:07,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:16:07,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,567 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2023-02-15 23:16:07,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:16:07,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:16:07,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:16:07,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:16:07,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:16:07,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:16:07,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:16:07,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:16:07,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 23:16:07,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,582 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2023-02-15 23:16:07,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 23:16:07,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 23:16:07,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 23:16:07,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 23:16:07,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 23:16:07,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 23:16:07,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 23:16:07,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 23:16:07,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 23:16:07,597 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 23:16:07,597 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 23:16:07,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 23:16:07,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:07,600 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 23:16:07,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2023-02-15 23:16:07,602 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 23:16:07,602 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 23:16:07,602 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 23:16:07,602 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2023-02-15 23:16:07,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:07,605 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 23:16:07,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:08,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 5187 conjuncts, 226 conjunts are in the unsatisfiable core [2023-02-15 23:16:08,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:10,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:11,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:16:11,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:16:11,869 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:16:11,869 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:11,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1230 states and 1288 transitions. Complement of second has 9 states. [2023-02-15 23:16:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:16:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:16:11,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 827 letters. Loop has 106 letters. [2023-02-15 23:16:11,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:11,889 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:16:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:12,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 5187 conjuncts, 226 conjunts are in the unsatisfiable core [2023-02-15 23:16:12,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:16,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:16:16,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:16:16,571 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:16:16,571 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:16,584 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 1230 states and 1288 transitions. Complement of second has 9 states. [2023-02-15 23:16:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:16:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 23:16:16,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 827 letters. Loop has 106 letters. [2023-02-15 23:16:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:16,586 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 23:16:16,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:16,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 5187 conjuncts, 226 conjunts are in the unsatisfiable core [2023-02-15 23:16:16,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:20,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 23:16:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-15 23:16:20,488 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-15 23:16:20,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65 Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:20,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1190 states and 1245 transitions. cyclomatic complexity: 65. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 2331 states and 2440 transitions. Complement of second has 10 states. [2023-02-15 23:16:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-15 23:16:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 23:16:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2023-02-15 23:16:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 827 letters. Loop has 106 letters. [2023-02-15 23:16:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 933 letters. Loop has 106 letters. [2023-02-15 23:16:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:20,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 827 letters. Loop has 212 letters. [2023-02-15 23:16:20,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 23:16:20,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2331 states and 2440 transitions. [2023-02-15 23:16:20,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 23:16:20,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2331 states to 1190 states and 1245 transitions. [2023-02-15 23:16:20,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2023-02-15 23:16:20,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-15 23:16:20,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1190 states and 1245 transitions. [2023-02-15 23:16:20,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:16:20,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1190 states and 1245 transitions. [2023-02-15 23:16:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states and 1245 transitions. [2023-02-15 23:16:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2023-02-15 23:16:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 856 states have (on average 1.0128504672897196) internal successors, (867), 864 states have internal predecessors, (867), 180 states have call successors, (185), 152 states have call predecessors, (185), 154 states have return successors, (193), 173 states have call predecessors, (193), 180 states have call successors, (193) [2023-02-15 23:16:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1245 transitions. [2023-02-15 23:16:20,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1190 states and 1245 transitions. [2023-02-15 23:16:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:16:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 23:16:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-02-15 23:16:20,598 INFO L87 Difference]: Start difference. First operand 1190 states and 1245 transitions. Second operand has 24 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 24 states have internal predecessors, (80), 20 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-02-15 23:16:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:16:20,820 INFO L93 Difference]: Finished difference Result 1420 states and 1550 transitions. [2023-02-15 23:16:20,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1420 states and 1550 transitions. [2023-02-15 23:16:20,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2023-02-15 23:16:20,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1420 states to 1408 states and 1534 transitions. [2023-02-15 23:16:20,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2023-02-15 23:16:20,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2023-02-15 23:16:20,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1408 states and 1534 transitions. [2023-02-15 23:16:20,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 23:16:20,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1408 states and 1534 transitions. [2023-02-15 23:16:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states and 1534 transitions. [2023-02-15 23:16:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1348. [2023-02-15 23:16:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 977 states have (on average 1.0163766632548619) internal successors, (993), 988 states have internal predecessors, (993), 217 states have call successors, (227), 152 states have call predecessors, (227), 154 states have return successors, (239), 207 states have call predecessors, (239), 217 states have call successors, (239) [2023-02-15 23:16:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1459 transitions. [2023-02-15 23:16:20,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1348 states and 1459 transitions. [2023-02-15 23:16:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 23:16:20,839 INFO L428 stractBuchiCegarLoop]: Abstraction has 1348 states and 1459 transitions. [2023-02-15 23:16:20,839 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-02-15 23:16:20,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1348 states and 1459 transitions. [2023-02-15 23:16:20,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2023-02-15 23:16:20,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 23:16:20,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 23:16:20,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [112, 112, 83, 50, 39, 39, 39, 39, 39, 39, 33, 29, 23, 23, 23, 22, 22, 11, 11, 11, 11, 4, 3, 3, 1, 1, 1, 1] [2023-02-15 23:16:20,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [69, 69, 57, 35, 28, 28, 28, 28, 28, 28, 22, 12, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1] [2023-02-15 23:16:20,844 INFO L748 eck$LassoCheckResult]: Stem: 246839#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 246799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 246800#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 246794#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 246795#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 246852#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246784#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246798#$Ultimate##0 ~p := #in~p;~q := #in~q; 248121#L20 assume ~p <= 0;#res := 1; 248120#partsFINAL assume true; 246783#partsEXIT >#68#return; 246785#L36-1 havoc main_#t~ret8#1; 248122#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248119#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246827#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246826#$Ultimate##0 ~p := #in~p;~q := #in~q; 246828#L20 assume ~p <= 0;#res := 1; 246846#partsFINAL assume true; 246847#partsEXIT >#68#return; 248118#L36-1 havoc main_#t~ret8#1; 248117#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248115#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248112#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 248113#$Ultimate##0 ~p := #in~p;~q := #in~q; 248116#L20 assume ~p <= 0;#res := 1; 248114#partsFINAL assume true; 248111#partsEXIT >#68#return; 248110#L36-1 havoc main_#t~ret8#1; 248109#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248107#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248100#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247708#$Ultimate##0 ~p := #in~p;~q := #in~q; 248106#L20 assume ~p <= 0;#res := 1; 248104#partsFINAL assume true; 248099#partsEXIT >#68#return; 248103#L36-1 havoc main_#t~ret8#1; 248108#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248105#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248101#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247708#$Ultimate##0 ~p := #in~p;~q := #in~q; 248106#L20 assume ~p <= 0;#res := 1; 248104#partsFINAL assume true; 248099#partsEXIT >#68#return; 248098#L36-1 havoc main_#t~ret8#1; 248097#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248096#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246824#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246822#$Ultimate##0 ~p := #in~p;~q := #in~q; 246825#L20 assume ~p <= 0;#res := 1; 248095#partsFINAL assume true; 248094#partsEXIT >#68#return; 248092#L36-1 havoc main_#t~ret8#1; 247728#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247729#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 247709#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 247710#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 248079#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248074#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 248077#$Ultimate##0 ~p := #in~p;~q := #in~q; 248086#L20 assume !(~p <= 0); 248082#L21 assume ~q <= 0;#res := 0; 248081#partsFINAL assume true; 248073#partsEXIT >#68#return; 248071#L36-1 havoc main_#t~ret8#1; 248070#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248068#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246792#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 248065#$Ultimate##0 ~p := #in~p;~q := #in~q; 248087#L20 assume !(~p <= 0); 248084#L21 assume !(~q <= 0); 248083#L22 assume !(~q > ~p); 246803#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246804#$Ultimate##0 ~p := #in~p;~q := #in~q; 248054#L20 assume ~p <= 0;#res := 1; 248050#partsFINAL assume true; 248048#partsEXIT >#64#return; 246790#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246793#$Ultimate##0 ~p := #in~p;~q := #in~q; 248060#L20 assume !(~p <= 0); 248059#L21 assume ~q <= 0;#res := 0; 248057#partsFINAL assume true; 248055#partsEXIT >#66#return; 246831#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246832#partsFINAL assume true; 248063#partsEXIT >#68#return; 248064#L36-1 havoc main_#t~ret8#1; 248066#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248062#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246817#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 248053#$Ultimate##0 ~p := #in~p;~q := #in~q; 248089#L20 assume !(~p <= 0); 246821#L21 assume !(~q <= 0); 246815#L22 assume ~q > ~p; 246818#L22-1 call #t~ret0 := parts(~p, ~p);< 246838#$Ultimate##0 ~p := #in~p;~q := #in~q; 248046#L20 assume !(~p <= 0); 248044#L21 assume !(~q <= 0); 248042#L22 assume !(~q > ~p); 248037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 248038#$Ultimate##0 ~p := #in~p;~q := #in~q; 248043#L20 assume ~p <= 0;#res := 1; 248041#partsFINAL assume true; 248036#partsEXIT >#64#return; 248030#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 248031#$Ultimate##0 ~p := #in~p;~q := #in~q; 248040#L20 assume !(~p <= 0); 248039#L21 assume ~q <= 0;#res := 0; 248035#partsFINAL assume true; 248029#partsEXIT >#66#return; 248027#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 248025#partsFINAL assume true; 248023#partsEXIT >#62#return; 246842#L22-2 #res := #t~ret0;havoc #t~ret0; 246843#partsFINAL assume true; 248051#partsEXIT >#68#return; 248052#L36-1 havoc main_#t~ret8#1; 248078#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248072#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248015#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247744#$Ultimate##0 ~p := #in~p;~q := #in~q; 248032#L20 assume !(~p <= 0); 248028#L21 assume !(~q <= 0); 248026#L22 assume ~q > ~p; 248024#L22-1 call #t~ret0 := parts(~p, ~p);< 246838#$Ultimate##0 ~p := #in~p;~q := #in~q; 248046#L20 assume !(~p <= 0); 248044#L21 assume !(~q <= 0); 248042#L22 assume !(~q > ~p); 248037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 248038#$Ultimate##0 ~p := #in~p;~q := #in~q; 248043#L20 assume ~p <= 0;#res := 1; 248041#partsFINAL assume true; 248036#partsEXIT >#64#return; 248030#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 248031#$Ultimate##0 ~p := #in~p;~q := #in~q; 248040#L20 assume !(~p <= 0); 248039#L21 assume ~q <= 0;#res := 0; 248035#partsFINAL assume true; 248029#partsEXIT >#66#return; 248027#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 248025#partsFINAL assume true; 248023#partsEXIT >#62#return; 248022#L22-2 #res := #t~ret0;havoc #t~ret0; 248021#partsFINAL assume true; 248012#partsEXIT >#68#return; 248018#L36-1 havoc main_#t~ret8#1; 248088#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 248085#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 248013#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247744#$Ultimate##0 ~p := #in~p;~q := #in~q; 248032#L20 assume !(~p <= 0); 248028#L21 assume !(~q <= 0); 248026#L22 assume ~q > ~p; 248024#L22-1 call #t~ret0 := parts(~p, ~p);< 246838#$Ultimate##0 ~p := #in~p;~q := #in~q; 248046#L20 assume !(~p <= 0); 248044#L21 assume !(~q <= 0); 248042#L22 assume !(~q > ~p); 248037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 248038#$Ultimate##0 ~p := #in~p;~q := #in~q; 248043#L20 assume ~p <= 0;#res := 1; 248041#partsFINAL assume true; 248036#partsEXIT >#64#return; 248030#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 248031#$Ultimate##0 ~p := #in~p;~q := #in~q; 248040#L20 assume !(~p <= 0); 248039#L21 assume ~q <= 0;#res := 0; 248035#partsFINAL assume true; 248029#partsEXIT >#66#return; 248027#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 248025#partsFINAL assume true; 248023#partsEXIT >#62#return; 248022#L22-2 #res := #t~ret0;havoc #t~ret0; 248021#partsFINAL assume true; 248012#partsEXIT >#68#return; 247837#L36-1 havoc main_#t~ret8#1; 247838#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247830#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247741#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247743#$Ultimate##0 ~p := #in~p;~q := #in~q; 247757#L20 assume !(~p <= 0); 247753#L21 assume !(~q <= 0); 247751#L22 assume ~q > ~p; 247748#L22-1 call #t~ret0 := parts(~p, ~p);< 247749#$Ultimate##0 ~p := #in~p;~q := #in~q; 247766#L20 assume !(~p <= 0); 247763#L21 assume !(~q <= 0); 247762#L22 assume !(~q > ~p); 247760#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247761#$Ultimate##0 ~p := #in~p;~q := #in~q; 247768#L20 assume ~p <= 0;#res := 1; 247765#partsFINAL assume true; 247759#partsEXIT >#64#return; 247755#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247756#$Ultimate##0 ~p := #in~p;~q := #in~q; 247767#L20 assume !(~p <= 0); 247764#L21 assume ~q <= 0;#res := 0; 247758#partsFINAL assume true; 247754#partsEXIT >#66#return; 247752#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247750#partsFINAL assume true; 247747#partsEXIT >#62#return; 247746#L22-2 #res := #t~ret0;havoc #t~ret0; 247745#partsFINAL assume true; 247738#partsEXIT >#68#return; 247742#L36-1 havoc main_#t~ret8#1; 247771#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247737#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 247735#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 247617#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 247612#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247592#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247595#$Ultimate##0 ~p := #in~p;~q := #in~q; 247608#L20 assume !(~p <= 0); 247606#L21 assume ~q <= 0;#res := 0; 247603#partsFINAL assume true; 247591#partsEXIT >#68#return; 247588#L36-1 havoc main_#t~ret8#1; 247587#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247586#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247547#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247553#$Ultimate##0 ~p := #in~p;~q := #in~q; 247628#L20 assume !(~p <= 0); 247627#L21 assume !(~q <= 0); 247623#L22 assume !(~q > ~p); 247621#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247622#$Ultimate##0 ~p := #in~p;~q := #in~q; 247654#L20 assume !(~p <= 0); 247652#L21 assume !(~q <= 0); 247650#L22 assume !(~q > ~p); 247647#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247648#$Ultimate##0 ~p := #in~p;~q := #in~q; 247660#L20 assume ~p <= 0;#res := 1; 247657#partsFINAL assume true; 247646#partsEXIT >#64#return; 247637#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247638#$Ultimate##0 ~p := #in~p;~q := #in~q; 247658#L20 assume !(~p <= 0); 247655#L21 assume ~q <= 0;#res := 0; 247645#partsFINAL assume true; 247636#partsEXIT >#66#return; 247633#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247630#partsFINAL assume true; 247620#partsEXIT >#64#return; 247575#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247576#$Ultimate##0 ~p := #in~p;~q := #in~q; 247585#L20 assume !(~p <= 0); 247583#L21 assume ~q <= 0;#res := 0; 247581#partsFINAL assume true; 247574#partsEXIT >#66#return; 247572#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247557#partsFINAL assume true; 247545#partsEXIT >#68#return; 247550#L36-1 havoc main_#t~ret8#1; 247565#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247563#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247520#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247522#$Ultimate##0 ~p := #in~p;~q := #in~q; 247602#L20 assume !(~p <= 0); 247601#L21 assume !(~q <= 0); 247600#L22 assume !(~q > ~p); 247597#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247598#$Ultimate##0 ~p := #in~p;~q := #in~q; 247618#L20 assume ~p <= 0;#res := 1; 247613#partsFINAL assume true; 247596#partsEXIT >#64#return; 247569#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247570#$Ultimate##0 ~p := #in~p;~q := #in~q; 247664#L20 assume !(~p <= 0); 247659#L21 assume !(~q <= 0); 247656#L22 assume !(~q > ~p); 247625#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247626#$Ultimate##0 ~p := #in~p;~q := #in~q; 247669#L20 assume !(~p <= 0); 247668#L21 assume !(~q <= 0); 247666#L22 assume !(~q > ~p); 247662#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247663#$Ultimate##0 ~p := #in~p;~q := #in~q; 247667#L20 assume ~p <= 0;#res := 1; 247665#partsFINAL assume true; 247661#partsEXIT >#64#return; 247641#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247642#$Ultimate##0 ~p := #in~p;~q := #in~q; 247653#L20 assume !(~p <= 0); 247651#L21 assume ~q <= 0;#res := 0; 247649#partsFINAL assume true; 247640#partsEXIT >#66#return; 247635#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247631#partsFINAL assume true; 247624#partsEXIT >#64#return; 247615#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247616#$Ultimate##0 ~p := #in~p;~q := #in~q; 247632#L20 assume !(~p <= 0); 247629#L21 assume ~q <= 0;#res := 0; 247619#partsFINAL assume true; 247614#partsEXIT >#66#return; 247611#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247589#partsFINAL assume true; 247568#partsEXIT >#66#return; 247567#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247537#partsFINAL assume true; 247519#partsEXIT >#68#return; 247514#L36-1 havoc main_#t~ret8#1; 247510#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247507#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247037#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246909#$Ultimate##0 ~p := #in~p;~q := #in~q; 247200#L20 assume !(~p <= 0); 247199#L21 assume !(~q <= 0); 247198#L22 assume ~q > ~p; 247195#L22-1 call #t~ret0 := parts(~p, ~p);< 247196#$Ultimate##0 ~p := #in~p;~q := #in~q; 247214#L20 assume !(~p <= 0); 247213#L21 assume !(~q <= 0); 247212#L22 assume !(~q > ~p); 247209#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247210#$Ultimate##0 ~p := #in~p;~q := #in~q; 247216#L20 assume ~p <= 0;#res := 1; 247215#partsFINAL assume true; 247208#partsEXIT >#64#return; 247205#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247206#$Ultimate##0 ~p := #in~p;~q := #in~q; 247419#L20 assume !(~p <= 0); 247416#L21 assume !(~q <= 0); 247413#L22 assume !(~q > ~p); 247410#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247412#$Ultimate##0 ~p := #in~p;~q := #in~q; 247434#L20 assume !(~p <= 0); 247431#L21 assume !(~q <= 0); 247429#L22 assume !(~q > ~p); 247426#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247427#$Ultimate##0 ~p := #in~p;~q := #in~q; 247442#L20 assume ~p <= 0;#res := 1; 247439#partsFINAL assume true; 247425#partsEXIT >#64#return; 247421#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247422#$Ultimate##0 ~p := #in~p;~q := #in~q; 247441#L20 assume !(~p <= 0); 247438#L21 assume ~q <= 0;#res := 0; 247424#partsFINAL assume true; 247420#partsEXIT >#66#return; 247417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247414#partsFINAL assume true; 247408#partsEXIT >#64#return; 247397#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247398#$Ultimate##0 ~p := #in~p;~q := #in~q; 247404#L20 assume !(~p <= 0); 247401#L21 assume ~q <= 0;#res := 0; 247400#partsFINAL assume true; 247396#partsEXIT >#66#return; 247218#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247217#partsFINAL assume true; 247204#partsEXIT >#66#return; 247202#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247201#partsFINAL assume true; 247194#partsEXIT >#62#return; 247192#L22-2 #res := #t~ret0;havoc #t~ret0; 247190#partsFINAL assume true; 247034#partsEXIT >#68#return; 247041#L36-1 havoc main_#t~ret8#1; 247503#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247502#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247036#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246909#$Ultimate##0 ~p := #in~p;~q := #in~q; 247200#L20 assume !(~p <= 0); 247199#L21 assume !(~q <= 0); 247198#L22 assume ~q > ~p; 247195#L22-1 call #t~ret0 := parts(~p, ~p);< 247196#$Ultimate##0 ~p := #in~p;~q := #in~q; 247214#L20 assume !(~p <= 0); 247213#L21 assume !(~q <= 0); 247212#L22 assume !(~q > ~p); 247209#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247210#$Ultimate##0 ~p := #in~p;~q := #in~q; 247216#L20 assume ~p <= 0;#res := 1; 247215#partsFINAL assume true; 247208#partsEXIT >#64#return; 247205#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247206#$Ultimate##0 ~p := #in~p;~q := #in~q; 247419#L20 assume !(~p <= 0); 247416#L21 assume !(~q <= 0); 247413#L22 assume !(~q > ~p); 247410#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247412#$Ultimate##0 ~p := #in~p;~q := #in~q; 247434#L20 assume !(~p <= 0); 247431#L21 assume !(~q <= 0); 247429#L22 assume !(~q > ~p); 247426#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247427#$Ultimate##0 ~p := #in~p;~q := #in~q; 247442#L20 assume ~p <= 0;#res := 1; 247439#partsFINAL assume true; 247425#partsEXIT >#64#return; 247421#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247422#$Ultimate##0 ~p := #in~p;~q := #in~q; 247441#L20 assume !(~p <= 0); 247438#L21 assume ~q <= 0;#res := 0; 247424#partsFINAL assume true; 247420#partsEXIT >#66#return; 247417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247414#partsFINAL assume true; 247408#partsEXIT >#64#return; 247397#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247398#$Ultimate##0 ~p := #in~p;~q := #in~q; 247404#L20 assume !(~p <= 0); 247401#L21 assume ~q <= 0;#res := 0; 247400#partsFINAL assume true; 247396#partsEXIT >#66#return; 247218#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247217#partsFINAL assume true; 247204#partsEXIT >#66#return; 247202#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247201#partsFINAL assume true; 247194#partsEXIT >#62#return; 247192#L22-2 #res := #t~ret0;havoc #t~ret0; 247190#partsFINAL assume true; 247034#partsEXIT >#68#return; 246939#L36-1 havoc main_#t~ret8#1; 246912#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 246910#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246780#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246864#$Ultimate##0 ~p := #in~p;~q := #in~q; 246861#L20 assume !(~p <= 0); 246858#L21 assume !(~q <= 0); 246855#L22 assume ~q > ~p; 246856#L22-1 call #t~ret0 := parts(~p, ~p);< 246896#$Ultimate##0 ~p := #in~p;~q := #in~q; 246892#L20 assume !(~p <= 0); 246891#L21 assume !(~q <= 0); 246890#L22 assume !(~q > ~p); 246875#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246876#$Ultimate##0 ~p := #in~p;~q := #in~q; 246889#L20 assume ~p <= 0;#res := 1; 246888#partsFINAL assume true; 246874#partsEXIT >#64#return; 246866#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246870#$Ultimate##0 ~p := #in~p;~q := #in~q; 246922#L20 assume !(~p <= 0); 246918#L21 assume !(~q <= 0); 246916#L22 assume !(~q > ~p); 246813#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246914#$Ultimate##0 ~p := #in~p;~q := #in~q; 247673#L20 assume !(~p <= 0); 247671#L21 assume !(~q <= 0); 246812#L22 assume !(~q > ~p); 246814#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246802#$Ultimate##0 ~p := #in~p;~q := #in~q; 247061#L20 assume ~p <= 0;#res := 1; 247060#partsFINAL assume true; 247057#partsEXIT >#64#return; 247055#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247056#$Ultimate##0 ~p := #in~p;~q := #in~q; 247071#L20 assume !(~p <= 0); 247069#L21 assume ~q <= 0;#res := 0; 247068#partsFINAL assume true; 247054#partsEXIT >#66#return; 247044#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246940#partsFINAL assume true; 246913#partsEXIT >#64#return; 246883#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246884#$Ultimate##0 ~p := #in~p;~q := #in~q; 246901#L20 assume !(~p <= 0); 246899#L21 assume ~q <= 0;#res := 0; 246895#partsFINAL assume true; 246882#partsEXIT >#66#return; 246880#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246872#partsFINAL assume true; 246865#partsEXIT >#66#return; 246862#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246863#partsFINAL assume true; 246857#partsEXIT >#62#return; 246840#L22-2 #res := #t~ret0;havoc #t~ret0; 246841#partsFINAL assume true; 246777#partsEXIT >#68#return; 246782#L36-1 havoc main_#t~ret8#1; 247717#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247714#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 247712#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 247106#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 247104#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247098#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247101#$Ultimate##0 ~p := #in~p;~q := #in~q; 247107#L20 assume !(~p <= 0); 247105#L21 assume ~q <= 0;#res := 0; 247103#partsFINAL assume true; 247097#partsEXIT >#68#return; 247100#L36-1 havoc main_#t~ret8#1; 247111#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247109#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247082#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247085#$Ultimate##0 ~p := #in~p;~q := #in~q; 247123#L20 assume !(~p <= 0); 247121#L21 assume !(~q <= 0); 247120#L22 assume !(~q > ~p); 247118#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247119#$Ultimate##0 ~p := #in~p;~q := #in~q; 247138#L20 assume !(~p <= 0); 247136#L21 assume !(~q <= 0); 247135#L22 assume !(~q > ~p); 247132#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247134#$Ultimate##0 ~p := #in~p;~q := #in~q; 247142#L20 assume !(~p <= 0); 247141#L21 assume !(~q <= 0); 247139#L22 assume !(~q > ~p); 247140#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247149#$Ultimate##0 ~p := #in~p;~q := #in~q; 247155#L20 assume ~p <= 0;#res := 1; 247153#partsFINAL assume true; 247148#partsEXIT >#64#return; 247145#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247146#$Ultimate##0 ~p := #in~p;~q := #in~q; 247164#L20 assume !(~p <= 0); 247163#L21 assume ~q <= 0;#res := 0; 247161#partsFINAL assume true; 247144#partsEXIT >#66#return; 247143#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247137#partsFINAL assume true; 247130#partsEXIT >#64#return; 247126#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247129#$Ultimate##0 ~p := #in~p;~q := #in~q; 247167#L20 assume !(~p <= 0); 247166#L21 assume ~q <= 0;#res := 0; 247165#partsFINAL assume true; 247125#partsEXIT >#66#return; 247124#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247122#partsFINAL assume true; 247117#partsEXIT >#64#return; 247113#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247116#$Ultimate##0 ~p := #in~p;~q := #in~q; 247173#L20 assume !(~p <= 0); 247171#L21 assume ~q <= 0;#res := 0; 247168#partsFINAL assume true; 247112#partsEXIT >#66#return; 247110#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247108#partsFINAL assume true; 247081#partsEXIT >#68#return; 247084#L36-1 havoc main_#t~ret8#1; 247332#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247330#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247306#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247308#$Ultimate##0 ~p := #in~p;~q := #in~q; 247324#L20 assume !(~p <= 0); 247322#L21 assume !(~q <= 0); 247321#L22 assume !(~q > ~p); 247319#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247320#$Ultimate##0 ~p := #in~p;~q := #in~q; 247333#L20 assume !(~p <= 0); 247331#L21 assume !(~q <= 0); 247329#L22 assume ~q > ~p; 247327#L22-1 call #t~ret0 := parts(~p, ~p);< 247328#$Ultimate##0 ~p := #in~p;~q := #in~q; 247354#L20 assume !(~p <= 0); 247352#L21 assume !(~q <= 0); 247350#L22 assume !(~q > ~p); 247347#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247348#$Ultimate##0 ~p := #in~p;~q := #in~q; 247356#L20 assume ~p <= 0;#res := 1; 247355#partsFINAL assume true; 247346#partsEXIT >#64#return; 247341#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247342#$Ultimate##0 ~p := #in~p;~q := #in~q; 247392#L20 assume !(~p <= 0); 247391#L21 assume ~q <= 0;#res := 0; 247389#partsFINAL assume true; 247340#partsEXIT >#66#return; 247336#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247334#partsFINAL assume true; 247326#partsEXIT >#62#return; 247325#L22-2 #res := #t~ret0;havoc #t~ret0; 247323#partsFINAL assume true; 247318#partsEXIT >#64#return; 247311#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247314#$Ultimate##0 ~p := #in~p;~q := #in~q; 247353#L20 assume !(~p <= 0); 247351#L21 assume !(~q <= 0); 247349#L22 assume !(~q > ~p); 247344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247345#$Ultimate##0 ~p := #in~p;~q := #in~q; 247371#L20 assume !(~p <= 0); 247369#L21 assume !(~q <= 0); 247368#L22 assume !(~q > ~p); 247366#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247367#$Ultimate##0 ~p := #in~p;~q := #in~q; 247375#L20 assume !(~p <= 0); 247373#L21 assume !(~q <= 0); 247374#L22 assume !(~q > ~p); 247380#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247381#$Ultimate##0 ~p := #in~p;~q := #in~q; 247384#L20 assume ~p <= 0;#res := 1; 247382#partsFINAL assume true; 247379#partsEXIT >#64#return; 247377#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247378#$Ultimate##0 ~p := #in~p;~q := #in~q; 247386#L20 assume !(~p <= 0); 247385#L21 assume ~q <= 0;#res := 0; 247383#partsFINAL assume true; 247376#partsEXIT >#66#return; 247362#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247370#partsFINAL assume true; 247364#partsEXIT >#64#return; 247360#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247363#$Ultimate##0 ~p := #in~p;~q := #in~q; 247390#L20 assume !(~p <= 0); 247388#L21 assume ~q <= 0;#res := 0; 247387#partsFINAL assume true; 247359#partsEXIT >#66#return; 247358#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247357#partsFINAL assume true; 247343#partsEXIT >#64#return; 247338#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247339#$Ultimate##0 ~p := #in~p;~q := #in~q; 247399#L20 assume !(~p <= 0); 247395#L21 assume ~q <= 0;#res := 0; 247393#partsFINAL assume true; 247337#partsEXIT >#66#return; 247335#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247317#partsFINAL assume true; 247310#partsEXIT >#66#return; 247313#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247394#partsFINAL assume true; 247305#partsEXIT >#68#return; 247307#L36-1 havoc main_#t~ret8#1; 247501#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247499#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247029#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247031#$Ultimate##0 ~p := #in~p;~q := #in~q; 247407#L20 assume !(~p <= 0); 247406#L21 assume !(~q <= 0); 247403#L22 assume !(~q > ~p); 247302#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247303#$Ultimate##0 ~p := #in~p;~q := #in~q; 247316#L20 assume ~p <= 0;#res := 1; 247315#partsFINAL assume true; 247301#partsEXIT >#64#return; 247297#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247298#$Ultimate##0 ~p := #in~p;~q := #in~q; 247492#L20 assume !(~p <= 0); 247490#L21 assume !(~q <= 0); 247488#L22 assume !(~q > ~p); 247452#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247453#$Ultimate##0 ~p := #in~p;~q := #in~q; 247471#L20 assume !(~p <= 0); 247470#L21 assume !(~q <= 0); 247468#L22 assume ~q > ~p; 247465#L22-1 call #t~ret0 := parts(~p, ~p);< 247466#$Ultimate##0 ~p := #in~p;~q := #in~q; 247484#L20 assume !(~p <= 0); 247483#L21 assume !(~q <= 0); 247482#L22 assume !(~q > ~p); 247480#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247481#$Ultimate##0 ~p := #in~p;~q := #in~q; 247486#L20 assume ~p <= 0;#res := 1; 247485#partsFINAL assume true; 247479#partsEXIT >#64#return; 247476#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247477#$Ultimate##0 ~p := #in~p;~q := #in~q; 247491#L20 assume !(~p <= 0); 247489#L21 assume ~q <= 0;#res := 0; 247487#partsFINAL assume true; 247475#partsEXIT >#66#return; 247473#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247472#partsFINAL assume true; 247464#partsEXIT >#62#return; 247462#L22-2 #res := #t~ret0;havoc #t~ret0; 247458#partsFINAL assume true; 247451#partsEXIT >#64#return; 247312#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247314#$Ultimate##0 ~p := #in~p;~q := #in~q; 247353#L20 assume !(~p <= 0); 247351#L21 assume !(~q <= 0); 247349#L22 assume !(~q > ~p); 247344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247345#$Ultimate##0 ~p := #in~p;~q := #in~q; 247371#L20 assume !(~p <= 0); 247369#L21 assume !(~q <= 0); 247368#L22 assume !(~q > ~p); 247366#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247367#$Ultimate##0 ~p := #in~p;~q := #in~q; 247375#L20 assume !(~p <= 0); 247373#L21 assume !(~q <= 0); 247374#L22 assume !(~q > ~p); 247380#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247381#$Ultimate##0 ~p := #in~p;~q := #in~q; 247384#L20 assume ~p <= 0;#res := 1; 247382#partsFINAL assume true; 247379#partsEXIT >#64#return; 247377#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247378#$Ultimate##0 ~p := #in~p;~q := #in~q; 247386#L20 assume !(~p <= 0); 247385#L21 assume ~q <= 0;#res := 0; 247383#partsFINAL assume true; 247376#partsEXIT >#66#return; 247362#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247370#partsFINAL assume true; 247364#partsEXIT >#64#return; 247360#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247363#$Ultimate##0 ~p := #in~p;~q := #in~q; 247390#L20 assume !(~p <= 0); 247388#L21 assume ~q <= 0;#res := 0; 247387#partsFINAL assume true; 247359#partsEXIT >#66#return; 247358#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247357#partsFINAL assume true; 247343#partsEXIT >#64#return; 247338#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247339#$Ultimate##0 ~p := #in~p;~q := #in~q; 247399#L20 assume !(~p <= 0); 247395#L21 assume ~q <= 0;#res := 0; 247393#partsFINAL assume true; 247337#partsEXIT >#66#return; 247335#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247317#partsFINAL assume true; 247310#partsEXIT >#66#return; 247309#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247300#partsFINAL assume true; 247296#partsEXIT >#66#return; 247293#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247291#partsFINAL assume true; 247028#partsEXIT >#68#return; 246935#L36-1 havoc main_#t~ret8#1; 247025#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247023#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246932#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246906#$Ultimate##0 ~p := #in~p;~q := #in~q; 246976#L20 assume !(~p <= 0); 246972#L21 assume !(~q <= 0); 246967#L22 assume ~q > ~p; 246964#L22-1 call #t~ret0 := parts(~p, ~p);< 246965#$Ultimate##0 ~p := #in~p;~q := #in~q; 247286#L20 assume !(~p <= 0); 247285#L21 assume !(~q <= 0); 247283#L22 assume !(~q > ~p); 247280#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247281#$Ultimate##0 ~p := #in~p;~q := #in~q; 247289#L20 assume ~p <= 0;#res := 1; 247287#partsFINAL assume true; 247279#partsEXIT >#64#return; 246991#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246992#$Ultimate##0 ~p := #in~p;~q := #in~q; 247013#L20 assume !(~p <= 0); 247011#L21 assume !(~q <= 0); 247010#L22 assume !(~q > ~p); 247007#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247009#$Ultimate##0 ~p := #in~p;~q := #in~q; 247026#L20 assume !(~p <= 0); 247024#L21 assume !(~q <= 0); 247022#L22 assume ~q > ~p; 247020#L22-1 call #t~ret0 := parts(~p, ~p);< 247021#$Ultimate##0 ~p := #in~p;~q := #in~q; 247239#L20 assume !(~p <= 0); 247237#L21 assume !(~q <= 0); 247235#L22 assume !(~q > ~p); 247232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247233#$Ultimate##0 ~p := #in~p;~q := #in~q; 247241#L20 assume ~p <= 0;#res := 1; 247240#partsFINAL assume true; 247231#partsEXIT >#64#return; 247227#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247228#$Ultimate##0 ~p := #in~p;~q := #in~q; 247277#L20 assume !(~p <= 0); 247276#L21 assume ~q <= 0;#res := 0; 247274#partsFINAL assume true; 247226#partsEXIT >#66#return; 247222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247220#partsFINAL assume true; 247019#partsEXIT >#62#return; 247018#L22-2 #res := #t~ret0;havoc #t~ret0; 247012#partsFINAL assume true; 247006#partsEXIT >#64#return; 247002#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247005#$Ultimate##0 ~p := #in~p;~q := #in~q; 247017#L20 assume !(~p <= 0); 247016#L21 assume !(~q <= 0); 247014#L22 assume !(~q > ~p); 247015#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247230#$Ultimate##0 ~p := #in~p;~q := #in~q; 247256#L20 assume !(~p <= 0); 247254#L21 assume !(~q <= 0); 247253#L22 assume !(~q > ~p); 247250#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247252#$Ultimate##0 ~p := #in~p;~q := #in~q; 247260#L20 assume !(~p <= 0); 247258#L21 assume !(~q <= 0); 247259#L22 assume !(~q > ~p); 247265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247266#$Ultimate##0 ~p := #in~p;~q := #in~q; 247269#L20 assume ~p <= 0;#res := 1; 247267#partsFINAL assume true; 247264#partsEXIT >#64#return; 247262#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247263#$Ultimate##0 ~p := #in~p;~q := #in~q; 247271#L20 assume !(~p <= 0); 247270#L21 assume ~q <= 0;#res := 0; 247268#partsFINAL assume true; 247261#partsEXIT >#66#return; 247247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247255#partsFINAL assume true; 247249#partsEXIT >#64#return; 247245#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247248#$Ultimate##0 ~p := #in~p;~q := #in~q; 247275#L20 assume !(~p <= 0); 247273#L21 assume ~q <= 0;#res := 0; 247272#partsFINAL assume true; 247244#partsEXIT >#66#return; 247243#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247242#partsFINAL assume true; 247229#partsEXIT >#64#return; 247224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247225#$Ultimate##0 ~p := #in~p;~q := #in~q; 247284#L20 assume !(~p <= 0); 247282#L21 assume ~q <= 0;#res := 0; 247278#partsFINAL assume true; 247223#partsEXIT >#66#return; 247221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247219#partsFINAL assume true; 246998#partsEXIT >#66#return; 246997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246995#partsFINAL assume true; 246990#partsEXIT >#66#return; 246989#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246988#partsFINAL assume true; 246963#partsEXIT >#62#return; 246959#L22-2 #res := #t~ret0;havoc #t~ret0; 246943#partsFINAL assume true; 246928#partsEXIT >#68#return; 246911#L36-1 [2023-02-15 23:16:20,845 INFO L750 eck$LassoCheckResult]: Loop: 246911#L36-1 havoc main_#t~ret8#1; 246908#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 246907#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246834#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246905#$Ultimate##0 ~p := #in~p;~q := #in~q; 246904#L20 assume !(~p <= 0); 246903#L21 assume !(~q <= 0); 246902#L22 assume ~q > ~p; 246833#L22-1 call #t~ret0 := parts(~p, ~p);< 246837#$Ultimate##0 ~p := #in~p;~q := #in~q; 246900#L20 assume !(~p <= 0); 246898#L21 assume !(~q <= 0); 246894#L22 assume !(~q > ~p); 246878#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246879#$Ultimate##0 ~p := #in~p;~q := #in~q; 246897#L20 assume ~p <= 0;#res := 1; 246893#partsFINAL assume true; 246877#partsEXIT >#64#return; 246868#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246871#$Ultimate##0 ~p := #in~p;~q := #in~q; 246950#L20 assume !(~p <= 0); 246949#L21 assume !(~q <= 0); 246948#L22 assume !(~q > ~p); 246946#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246947#$Ultimate##0 ~p := #in~p;~q := #in~q; 246961#L20 assume !(~p <= 0); 246957#L21 assume !(~q <= 0); 246956#L22 assume ~q > ~p; 246954#L22-1 call #t~ret0 := parts(~p, ~p);< 246955#$Ultimate##0 ~p := #in~p;~q := #in~q; 246979#L20 assume !(~p <= 0); 246978#L21 assume !(~q <= 0); 246977#L22 assume !(~q > ~p); 246974#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246975#$Ultimate##0 ~p := #in~p;~q := #in~q; 246987#L20 assume ~p <= 0;#res := 1; 246984#partsFINAL assume true; 246973#partsEXIT >#64#return; 246970#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246971#$Ultimate##0 ~p := #in~p;~q := #in~q; 246996#L20 assume !(~p <= 0); 246994#L21 assume ~q <= 0;#res := 0; 246993#partsFINAL assume true; 246969#partsEXIT >#66#return; 246966#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246960#partsFINAL assume true; 246953#partsEXIT >#62#return; 246952#L22-2 #res := #t~ret0;havoc #t~ret0; 246951#partsFINAL assume true; 246945#partsEXIT >#64#return; 246886#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246887#$Ultimate##0 ~p := #in~p;~q := #in~q; 246938#L20 assume !(~p <= 0); 246927#L21 assume !(~q <= 0); 246926#L22 assume !(~q > ~p); 246924#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246925#$Ultimate##0 ~p := #in~p;~q := #in~q; 247197#L20 assume !(~p <= 0); 247193#L21 assume !(~q <= 0); 247191#L22 assume !(~q > ~p); 246788#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246986#$Ultimate##0 ~p := #in~p;~q := #in~q; 247066#L20 assume !(~p <= 0); 247063#L21 assume !(~q <= 0); 247064#L22 assume !(~q > ~p); 246801#L23 call #t~ret1 := parts(~p - ~q, ~q);< 246802#$Ultimate##0 ~p := #in~p;~q := #in~q; 247061#L20 assume ~p <= 0;#res := 1; 247060#partsFINAL assume true; 247057#partsEXIT >#64#return; 246786#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246789#$Ultimate##0 ~p := #in~p;~q := #in~q; 246851#L20 assume !(~p <= 0); 246819#L21 assume ~q <= 0;#res := 0; 246820#partsFINAL assume true; 247713#partsEXIT >#66#return; 246829#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246830#partsFINAL assume true; 246985#partsEXIT >#64#return; 246981#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246983#$Ultimate##0 ~p := #in~p;~q := #in~q; 247067#L20 assume !(~p <= 0); 247065#L21 assume ~q <= 0;#res := 0; 247059#partsFINAL assume true; 246980#partsEXIT >#66#return; 246962#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246958#partsFINAL assume true; 246923#partsEXIT >#64#return; 246920#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246921#$Ultimate##0 ~p := #in~p;~q := #in~q; 246944#L20 assume !(~p <= 0); 246942#L21 assume ~q <= 0;#res := 0; 246941#partsFINAL assume true; 246919#partsEXIT >#66#return; 246917#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246915#partsFINAL assume true; 246885#partsEXIT >#66#return; 246881#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246873#partsFINAL assume true; 246867#partsEXIT >#66#return; 246869#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246859#partsFINAL assume true; 246860#partsEXIT >#62#return; 247711#L22-2 #res := #t~ret0;havoc #t~ret0; 247721#partsFINAL assume true; 247719#partsEXIT >#68#return; 247720#L36-1 havoc main_#t~ret8#1; 246844#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 246809#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 246805#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 246806#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 247688#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246796#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246797#$Ultimate##0 ~p := #in~p;~q := #in~q; 247532#L20 assume !(~p <= 0); 247531#L21 assume ~q <= 0;#res := 0; 247529#partsFINAL assume true; 247525#partsEXIT >#68#return; 247524#L36-1 havoc main_#t~ret8#1; 247516#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247513#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247156#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247162#$Ultimate##0 ~p := #in~p;~q := #in~q; 247160#L20 assume !(~p <= 0); 247159#L21 assume !(~q <= 0); 247158#L22 assume !(~q > ~p); 247147#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247154#$Ultimate##0 ~p := #in~p;~q := #in~q; 247152#L20 assume !(~p <= 0); 247151#L21 assume !(~q <= 0); 247150#L22 assume !(~q > ~p); 247133#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247134#$Ultimate##0 ~p := #in~p;~q := #in~q; 247142#L20 assume !(~p <= 0); 247141#L21 assume !(~q <= 0); 247139#L22 assume !(~q > ~p); 247131#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247134#$Ultimate##0 ~p := #in~p;~q := #in~q; 247142#L20 assume !(~p <= 0); 247141#L21 assume !(~q <= 0); 247139#L22 assume !(~q > ~p); 247140#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247149#$Ultimate##0 ~p := #in~p;~q := #in~q; 247155#L20 assume ~p <= 0;#res := 1; 247153#partsFINAL assume true; 247148#partsEXIT >#64#return; 247145#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247146#$Ultimate##0 ~p := #in~p;~q := #in~q; 247164#L20 assume !(~p <= 0); 247163#L21 assume ~q <= 0;#res := 0; 247161#partsFINAL assume true; 247144#partsEXIT >#66#return; 247143#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247137#partsFINAL assume true; 247130#partsEXIT >#64#return; 247127#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247129#$Ultimate##0 ~p := #in~p;~q := #in~q; 247167#L20 assume !(~p <= 0); 247166#L21 assume ~q <= 0;#res := 0; 247165#partsFINAL assume true; 247125#partsEXIT >#66#return; 247128#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247179#partsFINAL assume true; 247178#partsEXIT >#64#return; 247175#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247177#$Ultimate##0 ~p := #in~p;~q := #in~q; 247185#L20 assume !(~p <= 0); 247181#L21 assume ~q <= 0;#res := 0; 247180#partsFINAL assume true; 247174#partsEXIT >#66#return; 247172#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247170#partsFINAL assume true; 247169#partsEXIT >#64#return; 247114#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247116#$Ultimate##0 ~p := #in~p;~q := #in~q; 247173#L20 assume !(~p <= 0); 247171#L21 assume ~q <= 0;#res := 0; 247168#partsFINAL assume true; 247112#partsEXIT >#66#return; 247115#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247511#partsFINAL assume true; 247508#partsEXIT >#68#return; 247506#L36-1 havoc main_#t~ret8#1; 247505#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247504#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 247049#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 247053#$Ultimate##0 ~p := #in~p;~q := #in~q; 247188#L20 assume !(~p <= 0); 247187#L21 assume !(~q <= 0); 247186#L22 assume !(~q > ~p); 247183#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247184#$Ultimate##0 ~p := #in~p;~q := #in~q; 247211#L20 assume !(~p <= 0); 247207#L21 assume !(~q <= 0); 247203#L22 assume ~q > ~p; 247091#L22-1 call #t~ret0 := parts(~p, ~p);< 247094#$Ultimate##0 ~p := #in~p;~q := #in~q; 247701#L20 assume !(~p <= 0); 247700#L21 assume !(~q <= 0); 247698#L22 assume !(~q > ~p); 247695#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247696#$Ultimate##0 ~p := #in~p;~q := #in~q; 247699#L20 assume ~p <= 0;#res := 1; 247697#partsFINAL assume true; 247694#partsEXIT >#64#return; 247676#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247677#$Ultimate##0 ~p := #in~p;~q := #in~q; 247685#L20 assume !(~p <= 0); 247684#L21 assume ~q <= 0;#res := 0; 247682#partsFINAL assume true; 247675#partsEXIT >#66#return; 247674#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247672#partsFINAL assume true; 247090#partsEXIT >#62#return; 247093#L22-2 #res := #t~ret0;havoc #t~ret0; 247189#partsFINAL assume true; 247182#partsEXIT >#64#return; 247001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247074#$Ultimate##0 ~p := #in~p;~q := #in~q; 247238#L20 assume !(~p <= 0); 247236#L21 assume !(~q <= 0); 247234#L22 assume !(~q > ~p); 247015#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247230#$Ultimate##0 ~p := #in~p;~q := #in~q; 247256#L20 assume !(~p <= 0); 247254#L21 assume !(~q <= 0); 247253#L22 assume !(~q > ~p); 247250#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247252#$Ultimate##0 ~p := #in~p;~q := #in~q; 247260#L20 assume !(~p <= 0); 247258#L21 assume !(~q <= 0); 247259#L22 assume !(~q > ~p); 247265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247266#$Ultimate##0 ~p := #in~p;~q := #in~q; 247269#L20 assume ~p <= 0;#res := 1; 247267#partsFINAL assume true; 247264#partsEXIT >#64#return; 247262#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247263#$Ultimate##0 ~p := #in~p;~q := #in~q; 247271#L20 assume !(~p <= 0); 247270#L21 assume ~q <= 0;#res := 0; 247268#partsFINAL assume true; 247261#partsEXIT >#66#return; 247247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247255#partsFINAL assume true; 247249#partsEXIT >#64#return; 247245#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247248#$Ultimate##0 ~p := #in~p;~q := #in~q; 247275#L20 assume !(~p <= 0); 247273#L21 assume ~q <= 0;#res := 0; 247272#partsFINAL assume true; 247244#partsEXIT >#66#return; 247243#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247242#partsFINAL assume true; 247229#partsEXIT >#64#return; 247224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247225#$Ultimate##0 ~p := #in~p;~q := #in~q; 247284#L20 assume !(~p <= 0); 247282#L21 assume ~q <= 0;#res := 0; 247278#partsFINAL assume true; 247223#partsEXIT >#66#return; 247221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247219#partsFINAL assume true; 246998#partsEXIT >#66#return; 247004#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247070#partsFINAL assume true; 247045#partsEXIT >#68#return; 247043#L36-1 havoc main_#t~ret8#1; 247033#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247032#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246931#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246906#$Ultimate##0 ~p := #in~p;~q := #in~q; 246976#L20 assume !(~p <= 0); 246972#L21 assume !(~q <= 0); 246967#L22 assume !(~q > ~p); 246968#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247078#$Ultimate##0 ~p := #in~p;~q := #in~q; 247703#L20 assume !(~p <= 0); 247702#L21 assume !(~q <= 0); 247678#L22 assume ~q > ~p; 247092#L22-1 call #t~ret0 := parts(~p, ~p);< 247094#$Ultimate##0 ~p := #in~p;~q := #in~q; 247701#L20 assume !(~p <= 0); 247700#L21 assume !(~q <= 0); 247698#L22 assume !(~q > ~p); 247695#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247696#$Ultimate##0 ~p := #in~p;~q := #in~q; 247699#L20 assume ~p <= 0;#res := 1; 247697#partsFINAL assume true; 247694#partsEXIT >#64#return; 247676#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247677#$Ultimate##0 ~p := #in~p;~q := #in~q; 247685#L20 assume !(~p <= 0); 247684#L21 assume ~q <= 0;#res := 0; 247682#partsFINAL assume true; 247675#partsEXIT >#66#return; 247674#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247672#partsFINAL assume true; 247090#partsEXIT >#62#return; 247088#L22-2 #res := #t~ret0;havoc #t~ret0; 247086#partsFINAL assume true; 247077#partsEXIT >#64#return; 247000#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247005#$Ultimate##0 ~p := #in~p;~q := #in~q; 247017#L20 assume !(~p <= 0); 247016#L21 assume !(~q <= 0); 247014#L22 assume !(~q > ~p); 247008#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247009#$Ultimate##0 ~p := #in~p;~q := #in~q; 247026#L20 assume !(~p <= 0); 247024#L21 assume !(~q <= 0); 247022#L22 assume ~q > ~p; 247020#L22-1 call #t~ret0 := parts(~p, ~p);< 247021#$Ultimate##0 ~p := #in~p;~q := #in~q; 247239#L20 assume !(~p <= 0); 247237#L21 assume !(~q <= 0); 247235#L22 assume !(~q > ~p); 247232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247233#$Ultimate##0 ~p := #in~p;~q := #in~q; 247241#L20 assume ~p <= 0;#res := 1; 247240#partsFINAL assume true; 247231#partsEXIT >#64#return; 247227#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247228#$Ultimate##0 ~p := #in~p;~q := #in~q; 247277#L20 assume !(~p <= 0); 247276#L21 assume ~q <= 0;#res := 0; 247274#partsFINAL assume true; 247226#partsEXIT >#66#return; 247222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247220#partsFINAL assume true; 247019#partsEXIT >#62#return; 247018#L22-2 #res := #t~ret0;havoc #t~ret0; 247012#partsFINAL assume true; 247006#partsEXIT >#64#return; 246999#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247005#$Ultimate##0 ~p := #in~p;~q := #in~q; 247017#L20 assume !(~p <= 0); 247016#L21 assume !(~q <= 0); 247014#L22 assume !(~q > ~p); 247015#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247230#$Ultimate##0 ~p := #in~p;~q := #in~q; 247256#L20 assume !(~p <= 0); 247254#L21 assume !(~q <= 0); 247253#L22 assume !(~q > ~p); 247250#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247252#$Ultimate##0 ~p := #in~p;~q := #in~q; 247260#L20 assume !(~p <= 0); 247258#L21 assume !(~q <= 0); 247259#L22 assume !(~q > ~p); 247265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247266#$Ultimate##0 ~p := #in~p;~q := #in~q; 247269#L20 assume ~p <= 0;#res := 1; 247267#partsFINAL assume true; 247264#partsEXIT >#64#return; 247262#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247263#$Ultimate##0 ~p := #in~p;~q := #in~q; 247271#L20 assume !(~p <= 0); 247270#L21 assume ~q <= 0;#res := 0; 247268#partsFINAL assume true; 247261#partsEXIT >#66#return; 247247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247255#partsFINAL assume true; 247249#partsEXIT >#64#return; 247245#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247248#$Ultimate##0 ~p := #in~p;~q := #in~q; 247275#L20 assume !(~p <= 0); 247273#L21 assume ~q <= 0;#res := 0; 247272#partsFINAL assume true; 247244#partsEXIT >#66#return; 247243#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247242#partsFINAL assume true; 247229#partsEXIT >#64#return; 247224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247225#$Ultimate##0 ~p := #in~p;~q := #in~q; 247284#L20 assume !(~p <= 0); 247282#L21 assume ~q <= 0;#res := 0; 247278#partsFINAL assume true; 247223#partsEXIT >#66#return; 247221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247219#partsFINAL assume true; 246998#partsEXIT >#66#return; 247003#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247295#partsFINAL assume true; 247292#partsEXIT >#66#return; 247290#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247288#partsFINAL assume true; 247027#partsEXIT >#68#return; 246935#L36-1 havoc main_#t~ret8#1; 247025#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 247023#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 246932#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 246906#$Ultimate##0 ~p := #in~p;~q := #in~q; 246976#L20 assume !(~p <= 0); 246972#L21 assume !(~q <= 0); 246967#L22 assume ~q > ~p; 246964#L22-1 call #t~ret0 := parts(~p, ~p);< 246965#$Ultimate##0 ~p := #in~p;~q := #in~q; 247286#L20 assume !(~p <= 0); 247285#L21 assume !(~q <= 0); 247283#L22 assume !(~q > ~p); 247280#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247281#$Ultimate##0 ~p := #in~p;~q := #in~q; 247289#L20 assume ~p <= 0;#res := 1; 247287#partsFINAL assume true; 247279#partsEXIT >#64#return; 246991#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 246992#$Ultimate##0 ~p := #in~p;~q := #in~q; 247013#L20 assume !(~p <= 0); 247011#L21 assume !(~q <= 0); 247010#L22 assume !(~q > ~p); 247007#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247009#$Ultimate##0 ~p := #in~p;~q := #in~q; 247026#L20 assume !(~p <= 0); 247024#L21 assume !(~q <= 0); 247022#L22 assume ~q > ~p; 247020#L22-1 call #t~ret0 := parts(~p, ~p);< 247021#$Ultimate##0 ~p := #in~p;~q := #in~q; 247239#L20 assume !(~p <= 0); 247237#L21 assume !(~q <= 0); 247235#L22 assume !(~q > ~p); 247232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247233#$Ultimate##0 ~p := #in~p;~q := #in~q; 247241#L20 assume ~p <= 0;#res := 1; 247240#partsFINAL assume true; 247231#partsEXIT >#64#return; 247227#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247228#$Ultimate##0 ~p := #in~p;~q := #in~q; 247277#L20 assume !(~p <= 0); 247276#L21 assume ~q <= 0;#res := 0; 247274#partsFINAL assume true; 247226#partsEXIT >#66#return; 247222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247220#partsFINAL assume true; 247019#partsEXIT >#62#return; 247018#L22-2 #res := #t~ret0;havoc #t~ret0; 247012#partsFINAL assume true; 247006#partsEXIT >#64#return; 247002#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247005#$Ultimate##0 ~p := #in~p;~q := #in~q; 247017#L20 assume !(~p <= 0); 247016#L21 assume !(~q <= 0); 247014#L22 assume !(~q > ~p); 247015#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247230#$Ultimate##0 ~p := #in~p;~q := #in~q; 247256#L20 assume !(~p <= 0); 247254#L21 assume !(~q <= 0); 247253#L22 assume !(~q > ~p); 247250#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247252#$Ultimate##0 ~p := #in~p;~q := #in~q; 247260#L20 assume !(~p <= 0); 247258#L21 assume !(~q <= 0); 247259#L22 assume !(~q > ~p); 247265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 247266#$Ultimate##0 ~p := #in~p;~q := #in~q; 247269#L20 assume ~p <= 0;#res := 1; 247267#partsFINAL assume true; 247264#partsEXIT >#64#return; 247262#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247263#$Ultimate##0 ~p := #in~p;~q := #in~q; 247271#L20 assume !(~p <= 0); 247270#L21 assume ~q <= 0;#res := 0; 247268#partsFINAL assume true; 247261#partsEXIT >#66#return; 247247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247255#partsFINAL assume true; 247249#partsEXIT >#64#return; 247245#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247248#$Ultimate##0 ~p := #in~p;~q := #in~q; 247275#L20 assume !(~p <= 0); 247273#L21 assume ~q <= 0;#res := 0; 247272#partsFINAL assume true; 247244#partsEXIT >#66#return; 247243#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247242#partsFINAL assume true; 247229#partsEXIT >#64#return; 247224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 247225#$Ultimate##0 ~p := #in~p;~q := #in~q; 247284#L20 assume !(~p <= 0); 247282#L21 assume ~q <= 0;#res := 0; 247278#partsFINAL assume true; 247223#partsEXIT >#66#return; 247221#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 247219#partsFINAL assume true; 246998#partsEXIT >#66#return; 246997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246995#partsFINAL assume true; 246990#partsEXIT >#66#return; 246989#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 246988#partsFINAL assume true; 246963#partsEXIT >#62#return; 246959#L22-2 #res := #t~ret0;havoc #t~ret0; 246943#partsFINAL assume true; 246928#partsEXIT >#68#return; 246911#L36-1 [2023-02-15 23:16:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2101179516, now seen corresponding path program 15 times [2023-02-15 23:16:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:16:20,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614895700] [2023-02-15 23:16:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:16:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:16:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:21,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:16:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:16:21,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:16:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:16:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1526296577, now seen corresponding path program 7 times [2023-02-15 23:16:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:16:21,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900956647] [2023-02-15 23:16:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:16:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:16:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 23:16:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-02-15 23:16:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-02-15 23:16:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 23:16:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-02-15 23:16:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-02-15 23:16:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2023-02-15 23:16:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 23:16:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 23:16:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 23:16:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 23:16:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 23:16:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12817 backedges. 397 proven. 1607 refuted. 0 times theorem prover too weak. 10813 trivial. 0 not checked. [2023-02-15 23:16:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:16:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900956647] [2023-02-15 23:16:21,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900956647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:16:21,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75826652] [2023-02-15 23:16:21,787 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:16:21,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:16:21,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:16:21,788 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:16:21,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2023-02-15 23:16:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:16:22,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 23:16:22,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:16:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12817 backedges. 6852 proven. 634 refuted. 0 times theorem prover too weak. 5331 trivial. 0 not checked. [2023-02-15 23:16:22,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:16:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12817 backedges. 368 proven. 1644 refuted. 0 times theorem prover too weak. 10805 trivial. 0 not checked. [2023-02-15 23:16:22,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75826652] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:16:22,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:16:22,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 32 [2023-02-15 23:16:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224127305] [2023-02-15 23:16:22,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:16:22,813 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 23:16:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:16:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 23:16:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2023-02-15 23:16:22,814 INFO L87 Difference]: Start difference. First operand 1348 states and 1459 transitions. cyclomatic complexity: 123 Second operand has 32 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 30 states have internal predecessors, (112), 24 states have call successors, (35), 2 states have call predecessors, (35), 7 states have return successors, (37), 17 states have call predecessors, (37), 24 states have call successors, (37) [2023-02-15 23:16:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:16:23,279 INFO L93 Difference]: Finished difference Result 1860 states and 2042 transitions. [2023-02-15 23:16:23,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1860 states and 2042 transitions. [2023-02-15 23:16:23,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 23:16:23,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1860 states to 0 states and 0 transitions. [2023-02-15 23:16:23,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-15 23:16:23,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-15 23:16:23,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-15 23:16:23,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 23:16:23,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 23:16:23,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 23:16:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 23:16:23,285 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 23:16:23,285 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2023-02-15 23:16:23,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-15 23:16:23,286 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 23:16:23,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-15 23:16:23,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 11:16:23 BoogieIcfgContainer [2023-02-15 23:16:23,291 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 23:16:23,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 23:16:23,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 23:16:23,291 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 23:16:23,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:14:32" (3/4) ... [2023-02-15 23:16:23,293 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 23:16:23,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 23:16:23,294 INFO L158 Benchmark]: Toolchain (without parser) took 111701.85ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 115.4MB in the beginning and 724.6MB in the end (delta: -609.2MB). Peak memory consumption was 872.4MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,294 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 23:16:23,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 114.85ms. Allocated memory is still 148.9MB. Free memory was 115.4MB in the beginning and 105.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.08ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,295 INFO L158 Benchmark]: Boogie Preprocessor took 11.43ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 103.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,295 INFO L158 Benchmark]: RCFGBuilder took 271.00ms. Allocated memory is still 148.9MB. Free memory was 103.4MB in the beginning and 93.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,295 INFO L158 Benchmark]: BuchiAutomizer took 111280.65ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 93.6MB in the beginning and 724.6MB in the end (delta: -631.0MB). Peak memory consumption was 851.4MB. Max. memory is 16.1GB. [2023-02-15 23:16:23,295 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 1.6GB. Free memory is still 724.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 23:16:23,296 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.13ms. Allocated memory is still 123.7MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 114.85ms. Allocated memory is still 148.9MB. Free memory was 115.4MB in the beginning and 105.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.08ms. Allocated memory is still 148.9MB. Free memory was 105.9MB in the beginning and 104.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.43ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 103.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.00ms. Allocated memory is still 148.9MB. Free memory was 103.4MB in the beginning and 93.6MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 111280.65ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 93.6MB in the beginning and 724.6MB in the end (delta: -631.0MB). Peak memory consumption was 851.4MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 1.6GB. Free memory is still 724.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 44 terminating modules (26 trivial, 9 deterministic, 9 nondeterministic). One deterministic module has affine ranking function -1 * p and consists of 4 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * q + 1 and consists of 7 locations. One deterministic module has affine ranking function -1 * q + x and consists of 6 locations. One deterministic module has affine ranking function \old(q) and consists of 7 locations. One deterministic module has affine ranking function \old(p) and consists of 7 locations. One deterministic module has affine ranking function \old(q) and consists of 9 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * p + 3 and consists of 14 locations. One nondeterministic module has affine ranking function -2 * q + 1 and consists of 8 locations. One nondeterministic module has affine ranking function x + -1 * q and consists of 6 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 11 locations. One nondeterministic module has affine ranking function -2 * q + 7 and consists of 17 locations. One nondeterministic module has affine ranking function -1 * q + x and consists of 6 locations. One nondeterministic module has affine ranking function -1 * q + x and consists of 6 locations. One nondeterministic module has affine ranking function x + -1 * q and consists of 6 locations. 26 modules have a trivial ranking function, the largest among these consists of 50 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 111.2s and 29 iterations. TraceHistogramMax:112. Analysis of lassos took 47.3s. Construction of modules took 5.9s. Büchi inclusion checks took 56.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 41. Automata minimization 1.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 4720 StatesRemovedByMinimization, 39 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [9, 0, 9, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2977/3438 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3266 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3161 mSDsluCounter, 6799 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5043 mSDsCounter, 2802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14480 IncrementalHoareTripleChecker+Invalid, 17282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2802 mSolverCounterUnsat, 1756 mSDtfsCounter, 14480 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT2 conc0 concLT7 SILN0 SILU0 SILI2 SILT9 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp89 ukn100 mio100 lsp100 div108 bol100 ite100 ukn100 eq147 hnf93 smp94 dnf100 smp100 tf108 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 128ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 18 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 14.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-15 23:16:23,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:23,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:23,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:23,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2023-02-15 23:16:24,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2023-02-15 23:16:24,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:24,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:24,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:24,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:25,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:25,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:25,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:25,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:25,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:26,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2023-02-15 23:16:26,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2023-02-15 23:16:26,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:26,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:27,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2023-02-15 23:16:27,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-02-15 23:16:27,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE