./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 a31fd051 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-?-a31fd05 [2023-02-15 14:14:35,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:14:35,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:14:35,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:14:35,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:14:35,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:14:35,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:14:35,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:14:35,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:14:35,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:14:35,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:14:35,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:14:35,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:14:35,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:14:35,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:14:35,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:14:35,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:14:35,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:14:35,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:14:35,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:14:35,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:14:35,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:14:35,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:14:35,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:14:35,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:14:35,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:14:35,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:14:35,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:14:35,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:14:35,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:14:35,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:14:35,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:14:35,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:14:35,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:14:35,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:14:35,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:14:35,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:14:35,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:14:35,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:14:35,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:14:35,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:14:35,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:14:35,548 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:14:35,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:14:35,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:14:35,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:14:35,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:14:35,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:14:35,550 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:14:35,550 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:14:35,550 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:14:35,550 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:14:35,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:14:35,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:14:35,552 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:14:35,552 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:14:35,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:14:35,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:14:35,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:14:35,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:14:35,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:14:35,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:14:35,553 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 14:14:35,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:14:35,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:14:35,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:14:35,740 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:14:35,740 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:14:35,741 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 14:14:36,731 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:14:36,878 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:14:36,879 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2023-02-15 14:14:36,883 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773606bdd/2a56ccf1855a4fc6b3dc7afbd4540570/FLAGe01b10e11 [2023-02-15 14:14:36,893 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773606bdd/2a56ccf1855a4fc6b3dc7afbd4540570 [2023-02-15 14:14:36,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:14:36,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:14:36,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:36,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:14:36,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:14:36,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:36" (1/1) ... [2023-02-15 14:14:36,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fca8a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:36, skipping insertion in model container [2023-02-15 14:14:36,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:36" (1/1) ... [2023-02-15 14:14:36,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:14:36,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:14:37,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:37,047 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:14:37,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:37,066 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:14:37,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37 WrapperNode [2023-02-15 14:14:37,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:37,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:37,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:14:37,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:14:37,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,091 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2023-02-15 14:14:37,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:37,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:14:37,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:14:37,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:14:37,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,112 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:14:37,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:14:37,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:14:37,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:14:37,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (1/1) ... [2023-02-15 14:14:37,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,137 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 14:14:37,140 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 14:14:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2023-02-15 14:14:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2023-02-15 14:14:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:14:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:14:37,218 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:14:37,220 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:14:37,306 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:14:37,310 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:14:37,311 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 14:14:37,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:37 BoogieIcfgContainer [2023-02-15 14:14:37,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:14:37,313 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:14:37,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:14:37,315 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:14:37,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:37,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:14:36" (1/3) ... [2023-02-15 14:14:37,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22cb7dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:37, skipping insertion in model container [2023-02-15 14:14:37,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:37,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:37" (2/3) ... [2023-02-15 14:14:37,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22cb7dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:37, skipping insertion in model container [2023-02-15 14:14:37,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:37,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:37" (3/3) ... [2023-02-15 14:14:37,318 INFO L332 chiAutomizerObserver]: Analyzing ICFG Parts.c [2023-02-15 14:14:37,357 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:14:37,357 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:14:37,357 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:14:37,357 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:14:37,357 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:14:37,358 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:14:37,358 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:14:37,358 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:14:37,376 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 14:14:37,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 14:14:37,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:37,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:37,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:37,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:37,399 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:14:37,399 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 14:14:37,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 14:14:37,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:37,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:37,402 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:37,402 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:37,408 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 14:14:37,408 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 14:14:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2023-02-15 14:14:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864163104] [2023-02-15 14:14:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 68968, now seen corresponding path program 1 times [2023-02-15 14:14:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484375421] [2023-02-15 14:14:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:37,529 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 14:14:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484375421] [2023-02-15 14:14:37,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484375421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:37,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:37,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:14:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627428884] [2023-02-15 14:14:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:37,534 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 14:14:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 14:14:37,561 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 14:14:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:37,572 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-02-15 14:14:37,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2023-02-15 14:14:37,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 14:14:37,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 28 transitions. [2023-02-15 14:14:37,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-02-15 14:14:37,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-15 14:14:37,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2023-02-15 14:14:37,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:37,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 14:14:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2023-02-15 14:14:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 14:14:37,612 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 14:14:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2023-02-15 14:14:37,614 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 14:14:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 14:14:37,617 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2023-02-15 14:14:37,617 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:14:37,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2023-02-15 14:14:37,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 14:14:37,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:37,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:37,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:37,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:37,620 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 14:14:37,620 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 14:14:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2023-02-15 14:14:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132635690] [2023-02-15 14:14:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:37,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash 68720, now seen corresponding path program 1 times [2023-02-15 14:14:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667513551] [2023-02-15 14:14:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:37,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2051697257, now seen corresponding path program 1 times [2023-02-15 14:14:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:37,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872895721] [2023-02-15 14:14:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:37,690 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 14:14:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872895721] [2023-02-15 14:14:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872895721] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:37,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:14:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868316220] [2023-02-15 14:14:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:37,722 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:37,722 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:37,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:37,723 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:37,723 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:37,723 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,723 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:37,723 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:37,723 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2023-02-15 14:14:37,723 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:37,724 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:37,745 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 14:14:37,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 14:14:37,827 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:37,828 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:37,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,833 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 14:14:37,853 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 14:14:37,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:37,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:37,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:37,871 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 14:14:37,873 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 14:14:37,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:37,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:37,993 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:37,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:37,998 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:37,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:37,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:37,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:37,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:37,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:37,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:37,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:37,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2023-02-15 14:14:37,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:37,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:38,000 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 14:14:38,009 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 14:14:38,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:38,041 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,043 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 14:14:38,056 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 14:14:38,057 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 14:14:38,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:38,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:38,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:38,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:38,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:38,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:38,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:38,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:38,101 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-02-15 14:14:38,101 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-15 14:14:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,119 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 14:14:38,149 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 14:14:38,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:38,150 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:38,151 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:38,151 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 14:14:38,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-15 14:14:38,157 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:38,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:38,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:38,199 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:38,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:38,236 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 14:14:38,239 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 14:14:38,240 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 14:14:38,279 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 14:14:38,280 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 14:14:38,281 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 14:14:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2023-02-15 14:14:38,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-15 14:14:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:38,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-15 14:14:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:38,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-15 14:14:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:38,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2023-02-15 14:14:38,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-02-15 14:14:38,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 37 transitions. [2023-02-15 14:14:38,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-15 14:14:38,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 14:14:38,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2023-02-15 14:14:38,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:38,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-02-15 14:14:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2023-02-15 14:14:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-02-15 14:14:38,289 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 14:14:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-15 14:14:38,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-15 14:14:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:14:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:14:38,291 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 14:14:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:38,311 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-02-15 14:14:38,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2023-02-15 14:14:38,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-15 14:14:38,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2023-02-15 14:14:38,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-15 14:14:38,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-15 14:14:38,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2023-02-15 14:14:38,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:38,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-02-15 14:14:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2023-02-15 14:14:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-02-15 14:14:38,316 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 14:14:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-02-15 14:14:38,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-02-15 14:14:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:14:38,317 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-02-15 14:14:38,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:14:38,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2023-02-15 14:14:38,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-02-15 14:14:38,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:38,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:38,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-15 14:14:38,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:38,319 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 14:14:38,320 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 14:14:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2023-02-15 14:14:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:38,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271158972] [2023-02-15 14:14:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 523036987, now seen corresponding path program 1 times [2023-02-15 14:14:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:38,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602537282] [2023-02-15 14:14:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1398357556, now seen corresponding path program 1 times [2023-02-15 14:14:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:38,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619072857] [2023-02-15 14:14:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:38,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:38,436 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:38,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:38,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:38,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:38,437 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:38,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:38,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:38,437 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2023-02-15 14:14:38,437 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:38,437 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:38,438 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 14:14:38,440 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 14:14:38,441 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 14:14:38,443 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 14:14:38,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-15 14:14:38,496 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:38,497 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:38,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,498 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 14:14:38,500 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 14:14:38,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:38,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:38,523 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:38,523 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 14:14:38,529 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 14:14:38,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,537 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 14:14:38,539 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 14:14:38,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:38,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:38,562 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:38,562 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 14:14:38,567 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 14:14:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,569 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 14:14:38,571 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 14:14:38,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:38,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:38,591 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:38,591 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 14:14:38,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-15 14:14:38,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,621 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 14:14:38,648 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 14:14:38,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:38,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:38,682 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 14:14:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:38,683 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 14:14:38,686 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 14:14:38,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:38,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:38,958 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:38,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-02-15 14:14:38,963 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:38,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:38,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:38,964 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:38,964 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:38,964 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:38,964 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:38,964 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:38,964 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2023-02-15 14:14:38,964 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:38,964 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:38,965 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 14:14:38,983 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 14:14:38,986 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 14:14:38,994 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 14:14:39,048 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:39,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:39,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:39,052 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 14:14:39,082 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 14:14:39,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:39,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:39,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:39,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:39,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:39,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:39,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:39,089 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 14:14:39,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:39,113 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 14:14:39,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:39,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:39,115 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 14:14:39,117 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 14:14:39,118 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 14:14:39,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:39,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:39,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:39,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:39,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:39,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:39,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:39,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:39,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-02-15 14:14:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:39,130 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 14:14:39,132 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 14:14:39,134 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 14:14:39,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:39,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:39,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:39,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:39,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:39,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:39,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:39,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:39,165 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 14:14:39,165 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:39,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:39,181 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 14:14:39,186 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:39,186 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:39,186 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:39,186 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 14:14:39,186 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 14:14:39,189 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 14:14:39,190 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:39,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:39,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:39,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:39,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:39,352 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 14:14:39,353 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 14:14:39,353 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 14:14:39,541 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 14:14:39,541 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 14:14:39,542 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 14:14:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2023-02-15 14:14:39,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 11 letters. [2023-02-15 14:14:39,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 15 letters. Loop has 11 letters. [2023-02-15 14:14:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 22 letters. [2023-02-15 14:14:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:39,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 212 transitions. [2023-02-15 14:14:39,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2023-02-15 14:14:39,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 211 transitions. [2023-02-15 14:14:39,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-02-15 14:14:39,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2023-02-15 14:14:39,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 211 transitions. [2023-02-15 14:14:39,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:39,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 211 transitions. [2023-02-15 14:14:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 211 transitions. [2023-02-15 14:14:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2023-02-15 14:14:39,558 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 14:14:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2023-02-15 14:14:39,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-02-15 14:14:39,560 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-02-15 14:14:39,560 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:14:39,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 198 transitions. [2023-02-15 14:14:39,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2023-02-15 14:14:39,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:39,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:39,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:39,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:39,563 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 14:14:39,563 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 14:14:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2023-02-15 14:14:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:39,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507675675] [2023-02-15 14:14:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:39,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:39,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1489423173, now seen corresponding path program 1 times [2023-02-15 14:14:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807008] [2023-02-15 14:14:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 14:14:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:39,755 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 14:14:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807008] [2023-02-15 14:14:39,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:39,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:39,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 14:14:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010717007] [2023-02-15 14:14:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:39,756 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 14:14:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 14:14:39,758 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 14:14:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:39,966 INFO L93 Difference]: Finished difference Result 251 states and 420 transitions. [2023-02-15 14:14:39,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 420 transitions. [2023-02-15 14:14:39,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2023-02-15 14:14:39,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 245 states and 414 transitions. [2023-02-15 14:14:39,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-02-15 14:14:39,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-02-15 14:14:39,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 414 transitions. [2023-02-15 14:14:39,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:39,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 245 states and 414 transitions. [2023-02-15 14:14:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 414 transitions. [2023-02-15 14:14:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 214. [2023-02-15 14:14:40,007 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 14:14:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 367 transitions. [2023-02-15 14:14:40,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 367 transitions. [2023-02-15 14:14:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 14:14:40,011 INFO L428 stractBuchiCegarLoop]: Abstraction has 214 states and 367 transitions. [2023-02-15 14:14:40,011 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:14:40,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 367 transitions. [2023-02-15 14:14:40,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2023-02-15 14:14:40,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:40,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:40,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:40,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:40,013 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 14:14:40,013 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 14:14:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2023-02-15 14:14:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478137830] [2023-02-15 14:14:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 1 times [2023-02-15 14:14:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055620041] [2023-02-15 14:14:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash 616296708, now seen corresponding path program 1 times [2023-02-15 14:14:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828833789] [2023-02-15 14:14:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:40,078 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 14:14:40,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:40,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828833789] [2023-02-15 14:14:40,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828833789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:40,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:40,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:40,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723528295] [2023-02-15 14:14:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:40,158 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:40,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:40,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:40,158 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:40,158 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:40,158 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,158 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:40,158 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:40,158 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2023-02-15 14:14:40,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:40,159 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:40,160 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 14:14:40,161 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 14:14:40,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 14:14:40,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 14:14:40,170 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 14:14:40,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:40,189 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:40,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,205 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 14:14:40,206 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 14:14:40,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:40,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:40,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:40,219 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 14:14:40,224 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 14:14:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,225 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 14:14:40,239 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 14:14:40,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:40,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:40,248 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:40,248 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 14:14:40,253 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 14:14:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,277 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 14:14:40,281 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 14:14:40,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:40,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:40,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-15 14:14:40,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,339 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 14:14:40,341 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 14:14:40,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:40,342 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:40,363 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:40,383 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 14:14:40,383 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:40,383 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:40,383 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:40,383 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:40,383 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:40,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:40,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:40,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2023-02-15 14:14:40,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:40,383 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:40,384 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 14:14:40,386 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 14:14:40,391 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 14:14:40,394 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 14:14:40,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:40,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:40,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,415 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 14:14:40,438 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 14:14:40,438 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 14:14:40,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:40,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:40,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:40,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:40,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:40,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:40,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:40,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:40,450 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 14:14:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,451 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 14:14:40,454 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 14:14:40,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 14:14:40,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:40,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:40,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:40,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:40,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:40,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:40,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:40,484 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:40,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:40,487 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:14:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,501 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 14:14:40,555 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 14:14:40,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:40,555 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:40,555 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:40,555 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 14:14:40,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:40,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:40,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:40,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:40,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:40,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:40,661 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 14:14:40,661 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 14:14:40,661 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 14:14:40,757 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 14:14:40,758 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 14:14:40,758 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 14:14:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2023-02-15 14:14:40,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 9 letters. [2023-02-15 14:14:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:40,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 14 letters. Loop has 9 letters. [2023-02-15 14:14:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:40,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 18 letters. [2023-02-15 14:14:40,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:40,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1628 transitions. [2023-02-15 14:14:40,768 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2023-02-15 14:14:40,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 830 states and 1524 transitions. [2023-02-15 14:14:40,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2023-02-15 14:14:40,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 247 [2023-02-15 14:14:40,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1524 transitions. [2023-02-15 14:14:40,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:40,782 INFO L218 hiAutomatonCegarLoop]: Abstraction has 830 states and 1524 transitions. [2023-02-15 14:14:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1524 transitions. [2023-02-15 14:14:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 758. [2023-02-15 14:14:40,814 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 14:14:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1411 transitions. [2023-02-15 14:14:40,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 1411 transitions. [2023-02-15 14:14:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:40,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:14:40,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:14:40,820 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 14:14:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:40,866 INFO L93 Difference]: Finished difference Result 649 states and 994 transitions. [2023-02-15 14:14:40,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 994 transitions. [2023-02-15 14:14:40,871 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2023-02-15 14:14:40,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 312 states and 455 transitions. [2023-02-15 14:14:40,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2023-02-15 14:14:40,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2023-02-15 14:14:40,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 455 transitions. [2023-02-15 14:14:40,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:40,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 455 transitions. [2023-02-15 14:14:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 455 transitions. [2023-02-15 14:14:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 298. [2023-02-15 14:14:40,880 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 14:14:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 441 transitions. [2023-02-15 14:14:40,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 298 states and 441 transitions. [2023-02-15 14:14:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:14:40,882 INFO L428 stractBuchiCegarLoop]: Abstraction has 298 states and 441 transitions. [2023-02-15 14:14:40,882 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:14:40,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 441 transitions. [2023-02-15 14:14:40,884 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2023-02-15 14:14:40,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:40,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:40,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:40,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:40,884 INFO L748 eck$LassoCheckResult]: Stem: 3542#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3504#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; 3505#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3498#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; 3499#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 3512#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3500#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3501#$Ultimate##0 ~p := #in~p;~q := #in~q; 3717#L20 assume ~p <= 0;#res := 1; 3710#partsFINAL assume true; 3711#partsEXIT >#68#return; 3707#L36-1 [2023-02-15 14:14:40,884 INFO L750 eck$LassoCheckResult]: Loop: 3707#L36-1 havoc main_#t~ret8#1; 3704#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3705#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3494#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3768#$Ultimate##0 ~p := #in~p;~q := #in~q; 3714#L20 assume ~p <= 0;#res := 1; 3715#partsFINAL assume true; 3709#partsEXIT >#68#return; 3707#L36-1 [2023-02-15 14:14:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 618653416, now seen corresponding path program 1 times [2023-02-15 14:14:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572060866] [2023-02-15 14:14:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 1 times [2023-02-15 14:14:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089157611] [2023-02-15 14:14:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1870257459, now seen corresponding path program 1 times [2023-02-15 14:14:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543115241] [2023-02-15 14:14:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:40,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:40,953 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:40,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:40,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:40,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:40,953 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:40,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:40,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:40,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2023-02-15 14:14:40,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:40,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:40,953 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 14:14:40,955 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 14:14:40,958 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 14:14:40,960 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 14:14:40,980 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:40,980 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:40,981 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 14:14:41,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:41,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,008 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 14:14:41,025 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:41,025 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 14:14:41,043 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 14:14:41,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,045 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 14:14:41,046 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 14:14:41,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:41,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,082 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 14:14:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,083 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 14:14:41,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:41,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,120 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 14:14:41,339 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:41,343 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 14:14:41,343 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:41,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:41,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:41,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:41,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:41,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:41,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:41,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2023-02-15 14:14:41,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:41,343 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:41,344 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 14:14:41,356 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 14:14:41,360 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 14:14:41,362 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 14:14:41,388 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:41,388 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,401 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 14:14:41,402 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 14:14:41,409 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 14:14:41,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:41,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:41,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:41,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:41,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:41,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:41,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:41,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:41,451 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 14:14:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,452 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 14:14:41,471 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 14:14:41,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:41,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:41,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:41,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:41,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:41,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:41,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:41,483 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 14:14:41,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:41,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:41,503 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,506 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 14:14:41,506 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 14:14:41,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:41,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:41,507 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:41,507 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 14:14:41,510 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 14:14:41,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:41,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:14:41,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:41,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:41,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:41,614 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 14:14:41,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:41,642 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 14:14:41,643 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 14:14:41,643 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 14:14:41,706 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 14:14:41,706 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 14:14:41,707 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 14:14:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2023-02-15 14:14:41,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 8 letters. [2023-02-15 14:14:41,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:41,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 19 letters. Loop has 8 letters. [2023-02-15 14:14:41,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:41,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 16 letters. [2023-02-15 14:14:41,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:41,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 656 transitions. [2023-02-15 14:14:41,712 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2023-02-15 14:14:41,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 356 states and 523 transitions. [2023-02-15 14:14:41,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-15 14:14:41,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2023-02-15 14:14:41,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 523 transitions. [2023-02-15 14:14:41,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:41,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 356 states and 523 transitions. [2023-02-15 14:14:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 523 transitions. [2023-02-15 14:14:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2023-02-15 14:14:41,737 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 14:14:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 520 transitions. [2023-02-15 14:14:41,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 354 states and 520 transitions. [2023-02-15 14:14:41,739 INFO L428 stractBuchiCegarLoop]: Abstraction has 354 states and 520 transitions. [2023-02-15 14:14:41,739 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:14:41,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 520 transitions. [2023-02-15 14:14:41,741 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2023-02-15 14:14:41,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:41,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:41,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:41,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:41,741 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 14:14:41,742 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 14:14:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1998405187, now seen corresponding path program 1 times [2023-02-15 14:14:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222522700] [2023-02-15 14:14:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:41,761 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 14:14:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222522700] [2023-02-15 14:14:41,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222522700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:41,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:41,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:41,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408016827] [2023-02-15 14:14:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:41,762 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 28756405, now seen corresponding path program 1 times [2023-02-15 14:14:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590242054] [2023-02-15 14:14:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:41,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:41,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:41,803 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:41,803 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:41,803 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:41,803 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:41,803 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:41,803 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,803 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:41,803 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:41,803 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2023-02-15 14:14:41,803 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:41,803 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:41,804 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 14:14:41,805 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 14:14:41,810 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 14:14:41,812 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 14:14:41,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 14:14:41,814 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 14:14:41,816 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 14:14:41,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:41,841 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,857 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 14:14:41,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:41,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,878 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 14:14:41,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:41,887 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 14:14:41,892 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 14:14:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,895 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 14:14:41,898 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 14:14:41,899 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:41,899 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,925 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 14:14:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:41,927 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 14:14:41,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:41,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:41,952 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 14:14:42,052 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:42,077 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 14:14:42,077 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:42,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:42,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:42,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:42,078 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:42,078 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,078 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:42,078 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:42,078 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2023-02-15 14:14:42,078 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:42,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:42,078 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 14:14:42,080 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 14:14:42,081 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 14:14:42,086 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 14:14:42,087 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 14:14:42,088 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 14:14:42,089 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 14:14:42,112 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:42,113 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:42,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,114 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 14:14:42,116 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 14:14:42,118 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 14:14:42,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:42,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:42,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:42,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:42,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:42,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:42,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:42,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:42,144 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 14:14:42,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,146 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 14:14:42,148 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 14:14:42,149 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 14:14:42,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:42,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:42,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:42,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:42,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:42,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:42,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:42,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:42,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,161 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 14:14:42,163 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 14:14:42,164 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 14:14:42,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:42,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:42,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:42,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:42,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:42,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:42,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:42,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:42,198 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 14:14:42,199 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:14:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,200 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 14:14:42,202 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 14:14:42,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:42,203 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:42,203 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:42,203 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2023-02-15 14:14:42,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,209 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:42,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:42,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:42,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:42,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:42,280 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 14:14:42,280 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 14:14:42,280 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 14:14:42,359 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 14:14:42,360 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 14:14:42,360 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 14:14:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2023-02-15 14:14:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2023-02-15 14:14:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2023-02-15 14:14:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2023-02-15 14:14:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:42,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1995 transitions. [2023-02-15 14:14:42,372 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 218 [2023-02-15 14:14:42,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 1016 states and 1851 transitions. [2023-02-15 14:14:42,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2023-02-15 14:14:42,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2023-02-15 14:14:42,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1016 states and 1851 transitions. [2023-02-15 14:14:42,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:42,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1016 states and 1851 transitions. [2023-02-15 14:14:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states and 1851 transitions. [2023-02-15 14:14:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 911. [2023-02-15 14:14:42,403 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 14:14:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1573 transitions. [2023-02-15 14:14:42,408 INFO L240 hiAutomatonCegarLoop]: Abstraction has 911 states and 1573 transitions. [2023-02-15 14:14:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:14:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:14:42,409 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 14:14:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:42,436 INFO L93 Difference]: Finished difference Result 546 states and 873 transitions. [2023-02-15 14:14:42,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 873 transitions. [2023-02-15 14:14:42,440 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2023-02-15 14:14:42,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 529 states and 855 transitions. [2023-02-15 14:14:42,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2023-02-15 14:14:42,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2023-02-15 14:14:42,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 855 transitions. [2023-02-15 14:14:42,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:42,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 855 transitions. [2023-02-15 14:14:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 855 transitions. [2023-02-15 14:14:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 524. [2023-02-15 14:14:42,477 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 14:14:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2023-02-15 14:14:42,479 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 14:14:42,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 524 states and 850 transitions. [2023-02-15 14:14:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:14:42,483 INFO L428 stractBuchiCegarLoop]: Abstraction has 524 states and 850 transitions. [2023-02-15 14:14:42,483 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:14:42,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 850 transitions. [2023-02-15 14:14:42,485 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2023-02-15 14:14:42,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:42,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:42,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:42,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:42,486 INFO L748 eck$LassoCheckResult]: Stem: 7409#$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; 7427#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7370#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7371#$Ultimate##0 ~p := #in~p;~q := #in~q; 7869#L20 assume ~p <= 0;#res := 1; 7868#partsFINAL assume true; 7867#partsEXIT >#68#return; 7866#L36-1 havoc main_#t~ret8#1; 7411#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7388#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 7389#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 7547#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 7539#L35-3 [2023-02-15 14:14:42,486 INFO L750 eck$LassoCheckResult]: Loop: 7539#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7434#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7531#$Ultimate##0 ~p := #in~p;~q := #in~q; 7567#L20 assume !(~p <= 0); 7561#L21 assume ~q <= 0;#res := 0; 7557#partsFINAL assume true; 7551#partsEXIT >#68#return; 7549#L36-1 havoc main_#t~ret8#1; 7545#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7539#L35-3 [2023-02-15 14:14:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 399411315, now seen corresponding path program 2 times [2023-02-15 14:14:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:42,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999347150] [2023-02-15 14:14:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:42,523 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 14:14:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999347150] [2023-02-15 14:14:42,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999347150] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:42,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965242384] [2023-02-15 14:14:42,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:14:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,526 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 14:14:42,528 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 14:14:42,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:14:42,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:42,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:42,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:42,597 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 14:14:42,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:42,629 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 14:14:42,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965242384] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:42,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:42,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-15 14:14:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085921918] [2023-02-15 14:14:42,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:42,631 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 2 times [2023-02-15 14:14:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:42,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165597910] [2023-02-15 14:14:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:42,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:42,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:42,701 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:42,701 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:42,701 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:42,701 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:42,702 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:42,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:42,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:42,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2023-02-15 14:14:42,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:42,702 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:42,703 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 14:14:42,705 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 14:14:42,707 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 14:14:42,709 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 14:14:42,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:42,733 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:42,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,735 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 14:14:42,749 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 14:14:42,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:42,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:42,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:42,761 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 14:14:42,766 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 14:14:42,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,767 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 14:14:42,769 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 14:14:42,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:42,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:42,777 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:42,777 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 14:14:42,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,793 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 14:14:42,795 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 14:14:42,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:42,797 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:42,817 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:42,818 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 14:14:42,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,824 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 14:14:42,826 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 14:14:42,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:42,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:42,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,846 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 14:14:42,848 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 14:14:42,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:42,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:42,874 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:42,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:42,879 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:42,879 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:42,879 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:42,879 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:42,879 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:42,879 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:42,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:42,880 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2023-02-15 14:14:42,880 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:42,880 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:42,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 14:14:42,892 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 14:14:42,893 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 14:14:42,895 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 14:14:42,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:42,916 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,917 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 14:14:42,919 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 14:14:42,920 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 14:14:42,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:42,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:42,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:42,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:42,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:42,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:42,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:42,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:42,961 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 14:14:42,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,963 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 14:14:42,964 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 14:14:42,966 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 14:14:42,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:42,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:42,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:42,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:42,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:42,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:42,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:42,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:42,992 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 14:14:42,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:42,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:42,994 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 14:14:42,995 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 14:14:42,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 14:14:43,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:43,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:43,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:43,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:43,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:43,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:43,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:43,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:43,006 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 14:14:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:43,008 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 14:14:43,011 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 14:14:43,012 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 14:14:43,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:43,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:43,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:43,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:43,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:43,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:43,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:43,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:43,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:43,046 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:14:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:43,061 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 14:14:43,062 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 14:14:43,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:43,066 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:43,066 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:43,066 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 14:14:43,069 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 14:14:43,070 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,205 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 14:14:43,206 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 14:14:43,206 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 14:14:43,226 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 14:14:43,226 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 14:14:43,227 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 14:14:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 14:14:43,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 14:14:43,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:43,227 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,325 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 14:14:43,325 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 14:14:43,325 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 14:14:43,343 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 14:14:43,343 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 14:14:43,343 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 14:14:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2023-02-15 14:14:43,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 14:14:43,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:43,344 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,443 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 14:14:43,443 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 14:14:43,443 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 14:14:43,554 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 14:14:43,554 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 14:14:43,555 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 14:14:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2023-02-15 14:14:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 9 letters. [2023-02-15 14:14:43,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 25 letters. Loop has 9 letters. [2023-02-15 14:14:43,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:43,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 18 letters. [2023-02-15 14:14:43,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:43,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 2733 transitions. [2023-02-15 14:14:43,586 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 118 [2023-02-15 14:14:43,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1379 states and 2526 transitions. [2023-02-15 14:14:43,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2023-02-15 14:14:43,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 292 [2023-02-15 14:14:43,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1379 states and 2526 transitions. [2023-02-15 14:14:43,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:43,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1379 states and 2526 transitions. [2023-02-15 14:14:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states and 2526 transitions. [2023-02-15 14:14:43,608 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 14:14:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1298. [2023-02-15 14:14:43,629 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 14:14:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2369 transitions. [2023-02-15 14:14:43,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1298 states and 2369 transitions. [2023-02-15 14:14:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 14:14:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 14:14:43,636 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 14:14:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:43,684 INFO L93 Difference]: Finished difference Result 1477 states and 2646 transitions. [2023-02-15 14:14:43,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1477 states and 2646 transitions. [2023-02-15 14:14:43,695 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 158 [2023-02-15 14:14:43,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1477 states to 1463 states and 2631 transitions. [2023-02-15 14:14:43,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2023-02-15 14:14:43,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2023-02-15 14:14:43,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1463 states and 2631 transitions. [2023-02-15 14:14:43,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:43,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1463 states and 2631 transitions. [2023-02-15 14:14:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states and 2631 transitions. [2023-02-15 14:14:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1303. [2023-02-15 14:14:43,738 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 14:14:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2391 transitions. [2023-02-15 14:14:43,743 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2023-02-15 14:14:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 14:14:43,744 INFO L428 stractBuchiCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2023-02-15 14:14:43,744 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 14:14:43,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 2391 transitions. [2023-02-15 14:14:43,749 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 112 [2023-02-15 14:14:43,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:43,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:43,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:43,750 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 14:14:43,750 INFO L748 eck$LassoCheckResult]: Stem: 13712#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13675#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; 13676#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13669#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; 13670#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13728#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14637#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14638#$Ultimate##0 ~p := #in~p;~q := #in~q; 14642#L20 assume ~p <= 0;#res := 1; 14640#partsFINAL assume true; 14636#partsEXIT >#68#return; 14628#L36-1 havoc main_#t~ret8#1; 14597#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14596#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14591#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14593#$Ultimate##0 ~p := #in~p;~q := #in~q; 14595#L20 assume ~p <= 0;#res := 1; 14594#partsFINAL assume true; 14590#partsEXIT >#68#return; 14588#L36-1 havoc main_#t~ret8#1; 14572#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13974#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13972#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13971#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13930#L35-3 [2023-02-15 14:14:43,750 INFO L750 eck$LassoCheckResult]: Loop: 13930#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13923#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14320#$Ultimate##0 ~p := #in~p;~q := #in~q; 14318#L20 assume !(~p <= 0); 14316#L21 assume ~q <= 0;#res := 0; 14317#partsFINAL assume true; 14629#partsEXIT >#68#return; 14624#L36-1 havoc main_#t~ret8#1; 14005#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14002#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13650#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 13959#$Ultimate##0 ~p := #in~p;~q := #in~q; 13957#L20 assume !(~p <= 0); 13954#L21 assume !(~q <= 0); 13952#L22 assume !(~q > ~p); 13769#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13950#$Ultimate##0 ~p := #in~p;~q := #in~q; 13968#L20 assume ~p <= 0;#res := 1; 13966#partsFINAL assume true; 13949#partsEXIT >#64#return; 13751#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13946#$Ultimate##0 ~p := #in~p;~q := #in~q; 14016#L20 assume !(~p <= 0); 13969#L21 assume ~q <= 0;#res := 0; 14014#partsFINAL assume true; 13936#partsEXIT >#66#return; 13743#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13744#partsFINAL assume true; 13739#partsEXIT >#68#return; 13735#L36-1 havoc main_#t~ret8#1; 13736#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13731#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13732#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13970#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13930#L35-3 [2023-02-15 14:14:43,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 3 times [2023-02-15 14:14:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:43,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863621902] [2023-02-15 14:14:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:43,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:43,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1754826426, now seen corresponding path program 1 times [2023-02-15 14:14:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:43,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085646043] [2023-02-15 14:14:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 14:14:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 14:14:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:14:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:14:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,837 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 14:14:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085646043] [2023-02-15 14:14:43,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085646043] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859170449] [2023-02-15 14:14:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:43,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:43,838 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 14:14:43,840 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 14:14:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:43,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 14:14:43,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:43,965 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 14:14:43,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:44,070 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 14:14:44,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859170449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:44,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:44,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-02-15 14:14:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329915733] [2023-02-15 14:14:44,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:44,071 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:44,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 14:14:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-15 14:14:44,072 INFO L87 Difference]: Start difference. First operand 1303 states and 2391 transitions. cyclomatic complexity: 1113 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 14:14:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:44,447 INFO L93 Difference]: Finished difference Result 1619 states and 2691 transitions. [2023-02-15 14:14:44,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2691 transitions. [2023-02-15 14:14:44,457 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 202 [2023-02-15 14:14:44,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1559 states and 2623 transitions. [2023-02-15 14:14:44,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 353 [2023-02-15 14:14:44,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 353 [2023-02-15 14:14:44,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1559 states and 2623 transitions. [2023-02-15 14:14:44,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:44,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1559 states and 2623 transitions. [2023-02-15 14:14:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states and 2623 transitions. [2023-02-15 14:14:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1131. [2023-02-15 14:14:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 753 states have (on average 1.2098273572377158) internal successors, (911), 782 states have internal predecessors, (911), 237 states have call successors, (238), 108 states have call predecessors, (238), 141 states have return successors, (682), 240 states have call predecessors, (682), 237 states have call successors, (682) [2023-02-15 14:14:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1831 transitions. [2023-02-15 14:14:44,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1131 states and 1831 transitions. [2023-02-15 14:14:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 14:14:44,499 INFO L428 stractBuchiCegarLoop]: Abstraction has 1131 states and 1831 transitions. [2023-02-15 14:14:44,499 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 14:14:44,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1131 states and 1831 transitions. [2023-02-15 14:14:44,502 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 88 [2023-02-15 14:14:44,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:44,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:44,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:44,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-02-15 14:14:44,503 INFO L748 eck$LassoCheckResult]: Stem: 16910#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 16870#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; 16871#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16865#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; 16866#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 16924#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 17623#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 17625#$Ultimate##0 ~p := #in~p;~q := #in~q; 17628#L20 assume ~p <= 0;#res := 1; 17626#partsFINAL assume true; 17622#partsEXIT >#68#return; 17610#L36-1 havoc main_#t~ret8#1; 17609#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17608#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 17244#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 17246#$Ultimate##0 ~p := #in~p;~q := #in~q; 17660#L20 assume ~p <= 0;#res := 1; 17659#partsFINAL assume true; 17658#partsEXIT >#68#return; 17657#L36-1 havoc main_#t~ret8#1; 17656#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17234#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 17233#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 17229#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 17231#L35-3 [2023-02-15 14:14:44,504 INFO L750 eck$LassoCheckResult]: Loop: 17231#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 16849#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 16867#$Ultimate##0 ~p := #in~p;~q := #in~q; 17103#L20 assume !(~p <= 0); 17102#L21 assume !(~q <= 0); 17101#L22 assume !(~q > ~p); 16959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 17009#$Ultimate##0 ~p := #in~p;~q := #in~q; 17037#L20 assume ~p <= 0;#res := 1; 17010#partsFINAL assume true; 17008#partsEXIT >#64#return; 16943#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 16985#$Ultimate##0 ~p := #in~p;~q := #in~q; 17056#L20 assume !(~p <= 0); 17038#L21 assume ~q <= 0;#res := 0; 17032#partsFINAL assume true; 17093#partsEXIT >#66#return; 17028#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 17217#partsFINAL assume true; 17212#partsEXIT >#68#return; 17213#L36-1 havoc main_#t~ret8#1; 17221#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 17220#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 16850#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 16867#$Ultimate##0 ~p := #in~p;~q := #in~q; 17103#L20 assume !(~p <= 0); 17102#L21 assume !(~q <= 0); 17101#L22 assume !(~q > ~p); 16959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 17009#$Ultimate##0 ~p := #in~p;~q := #in~q; 17037#L20 assume ~p <= 0;#res := 1; 17010#partsFINAL assume true; 17008#partsEXIT >#64#return; 16943#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 16985#$Ultimate##0 ~p := #in~p;~q := #in~q; 17056#L20 assume !(~p <= 0); 17038#L21 assume ~q <= 0;#res := 0; 17032#partsFINAL assume true; 17093#partsEXIT >#66#return; 17028#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 17217#partsFINAL assume true; 17212#partsEXIT >#68#return; 17123#L36-1 havoc main_#t~ret8#1; 17124#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 16927#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 16928#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 17232#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 17231#L35-3 [2023-02-15 14:14:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 4 times [2023-02-15 14:14:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:44,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105968029] [2023-02-15 14:14:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:44,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:44,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 409198938, now seen corresponding path program 2 times [2023-02-15 14:14:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547445802] [2023-02-15 14:14:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 14:14:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:14:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:14:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:14:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:14:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:14:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 14:14:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:44,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547445802] [2023-02-15 14:14:44,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547445802] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:44,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328178662] [2023-02-15 14:14:44,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:14:44,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:44,593 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 14:14:44,595 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 14:14:44,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:14:44,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:44,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 14:14:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 14:14:44,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 14:14:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328178662] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:44,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-15 14:14:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471847246] [2023-02-15 14:14:44,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:44,947 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 14:14:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-02-15 14:14:44,947 INFO L87 Difference]: Start difference. First operand 1131 states and 1831 transitions. cyclomatic complexity: 725 Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-15 14:14:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:45,560 INFO L93 Difference]: Finished difference Result 1910 states and 3001 transitions. [2023-02-15 14:14:45,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1910 states and 3001 transitions. [2023-02-15 14:14:45,571 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 101 [2023-02-15 14:14:45,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1910 states to 1004 states and 1545 transitions. [2023-02-15 14:14:45,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2023-02-15 14:14:45,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2023-02-15 14:14:45,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1004 states and 1545 transitions. [2023-02-15 14:14:45,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:45,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1004 states and 1545 transitions. [2023-02-15 14:14:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states and 1545 transitions. [2023-02-15 14:14:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 944. [2023-02-15 14:14:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 660 states have (on average 1.162121212121212) internal successors, (767), 680 states have internal predecessors, (767), 155 states have call successors, (156), 93 states have call predecessors, (156), 129 states have return successors, (560), 170 states have call predecessors, (560), 153 states have call successors, (560) [2023-02-15 14:14:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1483 transitions. [2023-02-15 14:14:45,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1483 transitions. [2023-02-15 14:14:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 14:14:45,595 INFO L428 stractBuchiCegarLoop]: Abstraction has 944 states and 1483 transitions. [2023-02-15 14:14:45,595 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 14:14:45,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 944 states and 1483 transitions. [2023-02-15 14:14:45,599 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 96 [2023-02-15 14:14:45,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:45,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:45,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:45,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:45,600 INFO L748 eck$LassoCheckResult]: Stem: 20350#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20315#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; 20316#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20309#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; 20310#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20368#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 20313#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 20314#$Ultimate##0 ~p := #in~p;~q := #in~q; 20965#L20 assume ~p <= 0;#res := 1; 20963#partsFINAL assume true; 20959#partsEXIT >#68#return; 20958#L36-1 havoc main_#t~ret8#1; 20956#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20954#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 20951#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 20952#$Ultimate##0 ~p := #in~p;~q := #in~q; 20957#L20 assume ~p <= 0;#res := 1; 20955#partsFINAL assume true; 20950#partsEXIT >#68#return; 20945#L36-1 havoc main_#t~ret8#1; 20943#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20729#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 20726#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 20572#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 20569#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 20375#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 20644#$Ultimate##0 ~p := #in~p;~q := #in~q; 20645#L20 assume ~p <= 0;#res := 1; 21207#partsFINAL assume true; 21205#partsEXIT >#68#return; 21204#L36-1 [2023-02-15 14:14:45,600 INFO L750 eck$LassoCheckResult]: Loop: 21204#L36-1 havoc main_#t~ret8#1; 21203#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20598#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 20299#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 20592#$Ultimate##0 ~p := #in~p;~q := #in~q; 20593#L20 assume ~p <= 0;#res := 1; 21208#partsFINAL assume true; 21206#partsEXIT >#68#return; 21204#L36-1 [2023-02-15 14:14:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:45,600 INFO L85 PathProgramCache]: Analyzing trace with hash 768924849, now seen corresponding path program 5 times [2023-02-15 14:14:45,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:45,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714566548] [2023-02-15 14:14:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:14:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 14:14:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:45,635 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 14:14:45,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714566548] [2023-02-15 14:14:45,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714566548] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:45,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:45,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994909570] [2023-02-15 14:14:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:45,636 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 2 times [2023-02-15 14:14:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590538963] [2023-02-15 14:14:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:45,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:45,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:45,686 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:45,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:45,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:45,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:45,687 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:45,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:45,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:45,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2023-02-15 14:14:45,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:45,687 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:45,688 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 14:14:45,690 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 14:14:45,692 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 14:14:45,693 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 14:14:45,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:45,713 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:45,721 INFO L229 MonitoredProcess]: Starting monitored process 48 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 14:14:45,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-15 14:14:45,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:45,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:45,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:45,757 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 14:14:45,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:45,762 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 14:14:45,785 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 14:14:45,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:45,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:45,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:45,806 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 14:14:45,809 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 14:14:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:45,811 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 14:14:45,812 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 14:14:45,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:45,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:45,834 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:45,834 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 14:14:45,838 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 14:14:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:45,839 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 14:14:45,841 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 14:14:45,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:45,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:45,865 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 14:14:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:45,868 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 14:14:45,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:45,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:45,901 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 14:14:46,123 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:46,127 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 14:14:46,127 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:46,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:46,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:46,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:46,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:46,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:46,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:46,127 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration11_Loop [2023-02-15 14:14:46,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:46,127 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:46,128 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 14:14:46,136 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 14:14:46,138 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 14:14:46,140 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 14:14:46,161 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:46,162 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,169 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 14:14:46,171 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 14:14:46,173 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 14:14:46,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:46,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:46,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:46,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:46,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:46,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:46,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:46,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:46,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:46,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,200 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 14:14:46,202 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 14:14:46,203 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 14:14:46,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:46,208 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:46,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:46,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:46,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:46,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:46,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:46,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:46,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,230 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 14:14:46,231 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 14:14:46,233 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 14:14:46,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:46,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:46,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:46,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:46,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:46,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:46,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:46,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:46,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:46,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,244 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 14:14:46,246 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 14:14:46,248 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 14:14:46,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:46,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:46,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:46,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:46,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:46,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:46,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:46,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:46,258 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-15 14:14:46,258 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:46,259 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 14:14:46,260 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 14:14:46,262 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:46,262 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:46,262 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:46,262 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 14:14:46,265 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 14:14:46,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,440 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 14:14:46,440 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 14:14:46,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561 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 14:14:46,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561. 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 963 states and 1504 transitions. Complement of second has 10 states. [2023-02-15 14:14:46,482 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 14:14:46,482 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 14:14:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2023-02-15 14:14:46,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 14:14:46,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:46,483 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,631 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 14:14:46,632 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 14:14:46,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561 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 14:14:46,677 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561. 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 961 states and 1501 transitions. Complement of second has 12 states. [2023-02-15 14:14:46,678 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 14:14:46,678 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 14:14:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2023-02-15 14:14:46,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 14:14:46,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:46,679 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:46,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:46,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:46,799 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 14:14:46,800 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 14:14:46,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561 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 14:14:46,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 944 states and 1483 transitions. cyclomatic complexity: 561. 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 2247 states and 3589 transitions. Complement of second has 14 states. [2023-02-15 14:14:46,865 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 14:14:46,865 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 14:14:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2023-02-15 14:14:46,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 8 letters. [2023-02-15 14:14:46,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:46,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 38 letters. Loop has 8 letters. [2023-02-15 14:14:46,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:46,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 30 letters. Loop has 16 letters. [2023-02-15 14:14:46,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:46,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2247 states and 3589 transitions. [2023-02-15 14:14:46,881 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 125 [2023-02-15 14:14:46,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2247 states to 1866 states and 2920 transitions. [2023-02-15 14:14:46,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 405 [2023-02-15 14:14:46,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2023-02-15 14:14:46,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1866 states and 2920 transitions. [2023-02-15 14:14:46,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:46,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1866 states and 2920 transitions. [2023-02-15 14:14:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states and 2920 transitions. [2023-02-15 14:14:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1732. [2023-02-15 14:14:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1196 states have (on average 1.1538461538461537) internal successors, (1380), 1237 states have internal predecessors, (1380), 309 states have call successors, (330), 194 states have call predecessors, (330), 227 states have return successors, (1061), 300 states have call predecessors, (1061), 295 states have call successors, (1061) [2023-02-15 14:14:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2771 transitions. [2023-02-15 14:14:46,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1732 states and 2771 transitions. [2023-02-15 14:14:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:14:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:14:46,931 INFO L87 Difference]: Start difference. First operand 1732 states and 2771 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 14:14:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:46,988 INFO L93 Difference]: Finished difference Result 1086 states and 1696 transitions. [2023-02-15 14:14:46,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1086 states and 1696 transitions. [2023-02-15 14:14:46,993 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 14:14:46,997 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 120 [2023-02-15 14:14:47,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1086 states to 571 states and 902 transitions. [2023-02-15 14:14:47,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2023-02-15 14:14:47,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2023-02-15 14:14:47,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 571 states and 902 transitions. [2023-02-15 14:14:47,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:47,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 571 states and 902 transitions. [2023-02-15 14:14:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states and 902 transitions. [2023-02-15 14:14:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2023-02-15 14:14:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 396 states have (on average 1.1338383838383839) internal successors, (449), 399 states have internal predecessors, (449), 103 states have call successors, (110), 69 states have call predecessors, (110), 68 states have return successors, (339), 98 states have call predecessors, (339), 97 states have call successors, (339) [2023-02-15 14:14:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 898 transitions. [2023-02-15 14:14:47,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 567 states and 898 transitions. [2023-02-15 14:14:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:14:47,012 INFO L428 stractBuchiCegarLoop]: Abstraction has 567 states and 898 transitions. [2023-02-15 14:14:47,012 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 14:14:47,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 567 states and 898 transitions. [2023-02-15 14:14:47,015 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 120 [2023-02-15 14:14:47,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:47,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:47,015 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 14:14:47,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:47,016 INFO L748 eck$LassoCheckResult]: Stem: 28737#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 28696#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; 28697#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 28690#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; 28691#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28809#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 28804#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 28806#$Ultimate##0 ~p := #in~p;~q := #in~q; 28810#L20 assume ~p <= 0;#res := 1; 28807#partsFINAL assume true; 28803#partsEXIT >#68#return; 28802#L36-1 havoc main_#t~ret8#1; 28801#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28800#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 28761#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 28790#$Ultimate##0 ~p := #in~p;~q := #in~q; 28787#L20 assume ~p <= 0;#res := 1; 28788#partsFINAL assume true; 28760#partsEXIT >#68#return; 28762#L36-1 havoc main_#t~ret8#1; 28950#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 28949#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 28704#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 28705#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 28878#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 28869#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 28870#$Ultimate##0 ~p := #in~p;~q := #in~q; 28936#L20 assume !(~p <= 0); 28935#L21 assume !(~q <= 0); 28934#L22 assume !(~q > ~p); 28855#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28865#$Ultimate##0 [2023-02-15 14:14:47,016 INFO L750 eck$LassoCheckResult]: Loop: 28865#$Ultimate##0 ~p := #in~p;~q := #in~q; 28862#L20 assume !(~p <= 0); 28860#L21 assume !(~q <= 0); 28857#L22 assume !(~q > ~p); 28854#L23 call #t~ret1 := parts(~p - ~q, ~q);< 28865#$Ultimate##0 [2023-02-15 14:14:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1933114887, now seen corresponding path program 1 times [2023-02-15 14:14:47,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:47,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445883426] [2023-02-15 14:14:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:14:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,037 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 14:14:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:47,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445883426] [2023-02-15 14:14:47,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445883426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:47,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:47,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 14:14:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70974588] [2023-02-15 14:14:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:47,038 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 28756500, now seen corresponding path program 1 times [2023-02-15 14:14:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:47,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635033261] [2023-02-15 14:14:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:47,077 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:47,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:47,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:47,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:47,077 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:47,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:47,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:47,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2023-02-15 14:14:47,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:47,078 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:47,078 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 14:14:47,079 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 14:14:47,081 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 14:14:47,086 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 14:14:47,087 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 14:14:47,088 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 14:14:47,093 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 14:14:47,122 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:47,123 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:47,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,124 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 14:14:47,130 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 14:14:47,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:47,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:47,138 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 14:14:47,141 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 14:14:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,142 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 14:14:47,143 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 14:14:47,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:47,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:47,151 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:14:47,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-02-15 14:14:47,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,155 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 14:14:47,155 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 14:14:47,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:47,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:47,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,169 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 14:14:47,169 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 14:14:47,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:47,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,194 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:47,197 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 14:14:47,197 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:47,198 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:47,198 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:47,198 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:47,198 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:47,198 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,198 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:47,198 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:47,198 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2023-02-15 14:14:47,198 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:47,198 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:47,198 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 14:14:47,201 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 14:14:47,202 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 14:14:47,211 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 14:14:47,212 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 14:14:47,215 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 14:14:47,218 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 14:14:47,248 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:47,248 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,250 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 14:14:47,250 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 14:14:47,253 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 14:14:47,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:47,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:47,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:47,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:47,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:47,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:47,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:47,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:47,262 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 14:14:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,264 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 14:14:47,265 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 14:14:47,267 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 14:14:47,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:47,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:47,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:47,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:47,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:47,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:47,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:47,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:47,276 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 14:14:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,277 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 14:14:47,278 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 14:14:47,281 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 14:14:47,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:47,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:47,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:47,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:47,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:47,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:47,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:47,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:47,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:47,319 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,321 INFO L229 MonitoredProcess]: Starting monitored process 65 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 14:14:47,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-02-15 14:14:47,323 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:47,323 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:47,323 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:47,324 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2023-02-15 14:14:47,327 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 14:14:47,328 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:47,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:47,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:47,499 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 14:14:47,499 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 14:14:47,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 567 states and 898 transitions. cyclomatic complexity: 347 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 14:14:47,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 567 states and 898 transitions. cyclomatic complexity: 347. 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 834 states and 1267 transitions. Complement of second has 20 states. [2023-02-15 14:14:47,566 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 14:14:47,566 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 14:14:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2023-02-15 14:14:47,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 31 letters. Loop has 5 letters. [2023-02-15 14:14:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 36 letters. Loop has 5 letters. [2023-02-15 14:14:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 31 letters. Loop has 10 letters. [2023-02-15 14:14:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:47,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 834 states and 1267 transitions. [2023-02-15 14:14:47,571 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 120 [2023-02-15 14:14:47,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 834 states to 735 states and 1154 transitions. [2023-02-15 14:14:47,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2023-02-15 14:14:47,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2023-02-15 14:14:47,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 1154 transitions. [2023-02-15 14:14:47,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:47,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 735 states and 1154 transitions. [2023-02-15 14:14:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 1154 transitions. [2023-02-15 14:14:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 671. [2023-02-15 14:14:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 472 states have (on average 1.146186440677966) internal successors, (541), 484 states have internal predecessors, (541), 119 states have call successors, (126), 88 states have call predecessors, (126), 80 states have return successors, (389), 98 states have call predecessors, (389), 112 states have call successors, (389) [2023-02-15 14:14:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1056 transitions. [2023-02-15 14:14:47,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1056 transitions. [2023-02-15 14:14:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:14:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:14:47,589 INFO L87 Difference]: Start difference. First operand 671 states and 1056 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 14:14:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:47,611 INFO L93 Difference]: Finished difference Result 500 states and 758 transitions. [2023-02-15 14:14:47,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 758 transitions. [2023-02-15 14:14:47,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 71 [2023-02-15 14:14:47,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 492 states and 750 transitions. [2023-02-15 14:14:47,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2023-02-15 14:14:47,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2023-02-15 14:14:47,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 492 states and 750 transitions. [2023-02-15 14:14:47,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:47,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 492 states and 750 transitions. [2023-02-15 14:14:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states and 750 transitions. [2023-02-15 14:14:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 474. [2023-02-15 14:14:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 338 states have (on average 1.136094674556213) internal successors, (384), 348 states have internal predecessors, (384), 81 states have call successors, (88), 62 states have call predecessors, (88), 55 states have return successors, (260), 63 states have call predecessors, (260), 76 states have call successors, (260) [2023-02-15 14:14:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 732 transitions. [2023-02-15 14:14:47,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 474 states and 732 transitions. [2023-02-15 14:14:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:14:47,625 INFO L428 stractBuchiCegarLoop]: Abstraction has 474 states and 732 transitions. [2023-02-15 14:14:47,625 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-15 14:14:47,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 732 transitions. [2023-02-15 14:14:47,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2023-02-15 14:14:47,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:47,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:47,627 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 14:14:47,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:47,628 INFO L748 eck$LassoCheckResult]: Stem: 31462#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 31415#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; 31416#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 31413#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; 31414#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 31538#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 31533#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 31535#$Ultimate##0 ~p := #in~p;~q := #in~q; 31539#L20 assume ~p <= 0;#res := 1; 31536#partsFINAL assume true; 31532#partsEXIT >#68#return; 31530#L36-1 havoc main_#t~ret8#1; 31506#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 31505#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 31491#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 31496#$Ultimate##0 ~p := #in~p;~q := #in~q; 31493#L20 assume ~p <= 0;#res := 1; 31490#partsFINAL assume true; 31492#partsEXIT >#68#return; 31778#L36-1 havoc main_#t~ret8#1; 31463#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 31464#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 31427#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 31428#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 31429#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 31430#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 31525#$Ultimate##0 ~p := #in~p;~q := #in~q; 31782#L20 assume !(~p <= 0); 31779#L21 assume ~q <= 0;#res := 0; 31760#partsFINAL assume true; 31524#partsEXIT >#68#return; 31522#L36-1 havoc main_#t~ret8#1; 31520#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 31519#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 31443#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 31517#$Ultimate##0 ~p := #in~p;~q := #in~q; 31516#L20 assume !(~p <= 0); 31515#L21 assume !(~q <= 0); 31514#L22 assume !(~q > ~p); 31450#L23 call #t~ret1 := parts(~p - ~q, ~q);< 31747#$Ultimate##0 ~p := #in~p;~q := #in~q; 31748#L20 assume ~p <= 0;#res := 1; 31813#partsFINAL assume true; 31812#partsEXIT >#64#return; 31394#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 31798#$Ultimate##0 [2023-02-15 14:14:47,628 INFO L750 eck$LassoCheckResult]: Loop: 31798#$Ultimate##0 ~p := #in~p;~q := #in~q; 31809#L20 assume !(~p <= 0); 31808#L21 assume !(~q <= 0); 31807#L22 assume !(~q > ~p); 31404#L23 call #t~ret1 := parts(~p - ~q, ~q);< 31775#$Ultimate##0 ~p := #in~p;~q := #in~q; 31772#L20 assume ~p <= 0;#res := 1; 31773#partsFINAL assume true; 31804#partsEXIT >#64#return; 31395#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 31798#$Ultimate##0 [2023-02-15 14:14:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1585293162, now seen corresponding path program 1 times [2023-02-15 14:14:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:47,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057684816] [2023-02-15 14:14:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:47,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1964641052, now seen corresponding path program 1 times [2023-02-15 14:14:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189466654] [2023-02-15 14:14:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:47,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -574602427, now seen corresponding path program 2 times [2023-02-15 14:14:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30628234] [2023-02-15 14:14:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:14:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 14:14:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 14:14:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 14:14:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:47,715 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 14:14:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:47,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30628234] [2023-02-15 14:14:47,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30628234] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:47,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073236621] [2023-02-15 14:14:47,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:14:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,725 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:47,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2023-02-15 14:14:47,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:14:47,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:14:47,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 14:14:47,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:47,791 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 14:14:47,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:47,824 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 14:14:47,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073236621] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:47,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:47,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2023-02-15 14:14:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511942687] [2023-02-15 14:14:47,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:47,926 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:47,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:47,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:47,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:47,926 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:47,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:47,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:47,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2023-02-15 14:14:47,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:47,927 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:47,927 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 14:14:47,929 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 14:14:47,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 14:14:47,932 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 14:14:47,938 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 14:14:47,940 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 14:14:47,941 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 14:14:47,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:47,971 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:47,972 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 14:14:47,974 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 14:14:47,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:47,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:47,997 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:47,997 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 14:14:48,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,001 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 14:14:48,017 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 14:14:48,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:48,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:48,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:48,024 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 14:14:48,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,029 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 14:14:48,031 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 14:14:48,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:48,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:48,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:14:48,053 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 14:14:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,081 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 14:14:48,081 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 14:14:48,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:48,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:48,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,094 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 14:14:48,095 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 14:14:48,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:48,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:48,188 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:48,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,192 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:48,192 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:48,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:48,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:48,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:48,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:48,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:48,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2023-02-15 14:14:48,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:48,193 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:48,193 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 14:14:48,195 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 14:14:48,196 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 14:14:48,203 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 14:14:48,205 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 14:14:48,206 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 14:14:48,207 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 14:14:48,238 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:48,239 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,240 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 14:14:48,249 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 14:14:48,249 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 14:14:48,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:48,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:48,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:48,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:48,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:48,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:48,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:48,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:48,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,268 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 14:14:48,275 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 14:14:48,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:48,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:48,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:48,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:48,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:48,281 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 14:14:48,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:48,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:48,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:48,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2023-02-15 14:14:48,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,286 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 14:14:48,286 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 14:14:48,289 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 14:14:48,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:48,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:48,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:48,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:48,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:48,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:48,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:48,298 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:48,300 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:48,300 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,301 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 14:14:48,302 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 14:14:48,304 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:48,304 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:48,304 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:48,304 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2023-02-15 14:14:48,307 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 14:14:48,308 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:14:48,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:14:48,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:48,490 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 14:14:48,490 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 14:14:48,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 474 states and 732 transitions. cyclomatic complexity: 272 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 14:14:48,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 474 states and 732 transitions. cyclomatic complexity: 272. 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 1615 states and 2639 transitions. Complement of second has 35 states. [2023-02-15 14:14:48,636 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 14:14:48,637 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 14:14:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2023-02-15 14:14:48,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 45 letters. Loop has 10 letters. [2023-02-15 14:14:48,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:48,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 55 letters. Loop has 10 letters. [2023-02-15 14:14:48,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:48,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 65 transitions. Stem has 45 letters. Loop has 20 letters. [2023-02-15 14:14:48,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:48,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1615 states and 2639 transitions. [2023-02-15 14:14:48,646 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 115 [2023-02-15 14:14:48,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1615 states to 1242 states and 2034 transitions. [2023-02-15 14:14:48,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2023-02-15 14:14:48,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2023-02-15 14:14:48,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1242 states and 2034 transitions. [2023-02-15 14:14:48,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:48,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1242 states and 2034 transitions. [2023-02-15 14:14:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states and 2034 transitions. [2023-02-15 14:14:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1095. [2023-02-15 14:14:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 773 states have (on average 1.168175937904269) internal successors, (903), 810 states have internal predecessors, (903), 208 states have call successors, (215), 151 states have call predecessors, (215), 114 states have return successors, (602), 133 states have call predecessors, (602), 186 states have call successors, (602) [2023-02-15 14:14:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1720 transitions. [2023-02-15 14:14:48,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1095 states and 1720 transitions. [2023-02-15 14:14:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 14:14:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 14:14:48,679 INFO L87 Difference]: Start difference. First operand 1095 states and 1720 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 14:14:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:48,749 INFO L93 Difference]: Finished difference Result 1319 states and 2000 transitions. [2023-02-15 14:14:48,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1319 states and 2000 transitions. [2023-02-15 14:14:48,754 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 132 [2023-02-15 14:14:48,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1319 states to 1274 states and 1942 transitions. [2023-02-15 14:14:48,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2023-02-15 14:14:48,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2023-02-15 14:14:48,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1274 states and 1942 transitions. [2023-02-15 14:14:48,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:48,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1274 states and 1942 transitions. [2023-02-15 14:14:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states and 1942 transitions. [2023-02-15 14:14:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1214. [2023-02-15 14:14:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 851 states have (on average 1.1668625146886016) internal successors, (993), 896 states have internal predecessors, (993), 233 states have call successors, (242), 165 states have call predecessors, (242), 130 states have return successors, (639), 152 states have call predecessors, (639), 206 states have call successors, (639) [2023-02-15 14:14:48,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1874 transitions. [2023-02-15 14:14:48,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1214 states and 1874 transitions. [2023-02-15 14:14:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 14:14:48,824 INFO L428 stractBuchiCegarLoop]: Abstraction has 1214 states and 1874 transitions. [2023-02-15 14:14:48,824 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-15 14:14:48,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1214 states and 1874 transitions. [2023-02-15 14:14:48,828 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 125 [2023-02-15 14:14:48,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:48,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:48,828 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 14:14:48,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-02-15 14:14:48,829 INFO L748 eck$LassoCheckResult]: Stem: 36557#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 36517#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; 36518#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 36515#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; 36516#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 36536#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 36522#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 36523#$Ultimate##0 ~p := #in~p;~q := #in~q; 37695#L20 assume ~p <= 0;#res := 1; 37694#partsFINAL assume true; 37693#partsEXIT >#68#return; 36487#L36-1 havoc main_#t~ret8#1; 36574#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36702#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 36486#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 36631#$Ultimate##0 ~p := #in~p;~q := #in~q; 36604#L20 assume ~p <= 0;#res := 1; 36603#partsFINAL assume true; 36580#partsEXIT >#68#return; 36572#L36-1 havoc main_#t~ret8#1; 36573#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36789#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 36787#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 36584#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 36585#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 36778#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 36779#$Ultimate##0 ~p := #in~p;~q := #in~q; 36785#L20 assume !(~p <= 0); 36784#L21 assume ~q <= 0;#res := 0; 36781#partsFINAL assume true; 36777#partsEXIT >#68#return; 36774#L36-1 havoc main_#t~ret8#1; 36771#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 36766#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 36732#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 36761#$Ultimate##0 ~p := #in~p;~q := #in~q; 36758#L20 assume !(~p <= 0); 36755#L21 assume !(~q <= 0); 36752#L22 assume ~q > ~p; 36619#L22-1 call #t~ret0 := parts(~p, ~p);< 36729#$Ultimate##0 ~p := #in~p;~q := #in~q; 36730#L20 assume !(~p <= 0); 37057#L21 assume !(~q <= 0); 37055#L22 assume !(~q > ~p); 37053#L23 call #t~ret1 := parts(~p - ~q, ~q);< 37054#$Ultimate##0 ~p := #in~p;~q := #in~q; 37061#L20 assume ~p <= 0;#res := 1; 37060#partsFINAL assume true; 37052#partsEXIT >#64#return; 36526#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 37050#$Ultimate##0 ~p := #in~p;~q := #in~q; 37051#L20 assume !(~p <= 0); 37342#L21 assume !(~q <= 0); 36537#L22 [2023-02-15 14:14:48,829 INFO L750 eck$LassoCheckResult]: Loop: 36537#L22 assume !(~q > ~p); 36524#L23 call #t~ret1 := parts(~p - ~q, ~q);< 36528#$Ultimate##0 ~p := #in~p;~q := #in~q; 36543#L20 assume !(~p <= 0); 36539#L21 assume !(~q <= 0); 36537#L22 [2023-02-15 14:14:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash -505554686, now seen corresponding path program 1 times [2023-02-15 14:14:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:48,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33211568] [2023-02-15 14:14:48,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:14:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:14:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 14:14:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 14:14:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,867 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 14:14:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33211568] [2023-02-15 14:14:48,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33211568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554393111] [2023-02-15 14:14:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:48,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:48,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:48,869 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2023-02-15 14:14:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:48,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:48,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:48,937 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 14:14:48,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:48,967 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 14:14:48,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554393111] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:48,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:48,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-02-15 14:14:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320600134] [2023-02-15 14:14:48,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:48,968 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 43435410, now seen corresponding path program 2 times [2023-02-15 14:14:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241195174] [2023-02-15 14:14:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:48,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:48,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:49,025 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:49,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:49,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:49,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:49,025 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:14:49,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:49,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:49,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:49,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2023-02-15 14:14:49,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:49,026 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:49,026 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 14:14:49,035 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 14:14:49,036 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 14:14:49,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 14:14:49,039 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 14:14:49,071 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:49,071 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:14:49,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:49,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:49,072 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 14:14:49,074 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 14:14:49,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:14:49,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:49,100 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 14:14:49,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:49,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:49,101 INFO L229 MonitoredProcess]: Starting monitored process 78 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 14:14:49,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-02-15 14:14:49,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:14:49,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:14:58,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:14:58,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:58,895 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:58,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:58,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:58,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:58,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:58,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:58,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:58,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:58,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2023-02-15 14:14:58,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:58,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:58,896 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 14:14:58,900 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 14:14:58,904 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 14:14:58,905 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 14:14:58,906 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 14:14:58,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:58,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:58,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:58,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:58,949 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 14:14:58,954 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 14:14:58,955 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 14:14:58,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:58,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:58,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:58,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:58,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:58,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:58,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:58,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:58,965 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 14:14:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:58,967 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 14:14:58,968 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 14:14:58,970 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 14:14:58,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:58,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:58,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:58,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:58,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:58,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:58,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:58,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:58,989 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 14:14:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:58,991 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 14:14:58,992 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 14:14:58,994 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 14:14:58,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:59,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:59,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:59,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:59,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:59,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:59,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:59,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:59,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2023-02-15 14:14:59,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:59,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:59,019 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 14:14:59,021 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 14:14:59,023 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 14:14:59,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:59,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:59,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:59,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:59,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:59,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:59,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:59,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:59,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-02-15 14:14:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:59,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:59,049 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 14:14:59,050 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 14:14:59,052 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 14:14:59,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:59,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:59,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:59,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:59,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:59,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:59,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:59,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:59,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:14:59,070 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:14:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:59,080 INFO L229 MonitoredProcess]: Starting monitored process 84 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 14:14:59,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-02-15 14:14:59,083 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:59,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:14:59,083 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:59,083 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2023-02-15 14:14:59,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2023-02-15 14:14:59,086 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:14:59,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,263 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 14:14:59,264 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 14:14:59,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700 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 14:14:59,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700. 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 1269 states and 1934 transitions. Complement of second has 15 states. [2023-02-15 14:14:59,326 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 14:14:59,326 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 14:14:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2023-02-15 14:14:59,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 14:14:59,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:59,327 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,496 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 14:14:59,496 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 14:14:59,496 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700 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 14:14:59,551 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700. 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 1269 states and 1934 transitions. Complement of second has 15 states. [2023-02-15 14:14:59,552 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 14:14:59,552 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 14:14:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2023-02-15 14:14:59,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 14:14:59,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:59,552 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:59,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:59,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:59,752 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 14:14:59,752 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 14:14:59,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700 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 14:14:59,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1214 states and 1874 transitions. cyclomatic complexity: 700. 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 1775 states and 2708 transitions. Complement of second has 20 states. [2023-02-15 14:14:59,828 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 14:14:59,829 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 14:14:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2023-02-15 14:14:59,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 53 letters. Loop has 5 letters. [2023-02-15 14:14:59,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:59,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 58 letters. Loop has 5 letters. [2023-02-15 14:14:59,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:59,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 53 letters. Loop has 10 letters. [2023-02-15 14:14:59,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:59,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1775 states and 2708 transitions. [2023-02-15 14:14:59,839 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 130 [2023-02-15 14:14:59,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1775 states to 1388 states and 2213 transitions. [2023-02-15 14:14:59,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2023-02-15 14:14:59,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2023-02-15 14:14:59,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1388 states and 2213 transitions. [2023-02-15 14:14:59,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:59,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1388 states and 2213 transitions. [2023-02-15 14:14:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states and 2213 transitions. [2023-02-15 14:14:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1224. [2023-02-15 14:14:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 853 states have (on average 1.1875732708089097) internal successors, (1013), 901 states have internal predecessors, (1013), 244 states have call successors, (253), 171 states have call predecessors, (253), 127 states have return successors, (559), 151 states have call predecessors, (559), 220 states have call successors, (559) [2023-02-15 14:14:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1825 transitions. [2023-02-15 14:14:59,873 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1224 states and 1825 transitions. [2023-02-15 14:14:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 14:14:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 14:14:59,874 INFO L87 Difference]: Start difference. First operand 1224 states and 1825 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 14:14:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:59,945 INFO L93 Difference]: Finished difference Result 1254 states and 1836 transitions. [2023-02-15 14:14:59,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1254 states and 1836 transitions. [2023-02-15 14:14:59,950 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 113 [2023-02-15 14:14:59,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1254 states to 1236 states and 1816 transitions. [2023-02-15 14:14:59,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2023-02-15 14:14:59,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2023-02-15 14:14:59,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1236 states and 1816 transitions. [2023-02-15 14:14:59,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:59,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1236 states and 1816 transitions. [2023-02-15 14:14:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states and 1816 transitions. [2023-02-15 14:14:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1192. [2023-02-15 14:14:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 832 states have (on average 1.1826923076923077) internal successors, (984), 877 states have internal predecessors, (984), 235 states have call successors, (242), 167 states have call predecessors, (242), 125 states have return successors, (543), 147 states have call predecessors, (543), 215 states have call successors, (543) [2023-02-15 14:14:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1769 transitions. [2023-02-15 14:14:59,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1192 states and 1769 transitions. [2023-02-15 14:14:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 14:14:59,977 INFO L428 stractBuchiCegarLoop]: Abstraction has 1192 states and 1769 transitions. [2023-02-15 14:14:59,977 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-15 14:14:59,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1192 states and 1769 transitions. [2023-02-15 14:14:59,980 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 106 [2023-02-15 14:14:59,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:59,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:59,981 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 14:14:59,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:59,981 INFO L748 eck$LassoCheckResult]: Stem: 45514#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 45478#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; 45479#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 45472#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; 45473#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 45495#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 45476#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 45477#$Ultimate##0 ~p := #in~p;~q := #in~q; 46633#L20 assume ~p <= 0;#res := 1; 46632#partsFINAL assume true; 46631#partsEXIT >#68#return; 45447#L36-1 havoc main_#t~ret8#1; 45528#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45632#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 45446#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 45579#$Ultimate##0 ~p := #in~p;~q := #in~q; 45553#L20 assume ~p <= 0;#res := 1; 45552#partsFINAL assume true; 45533#partsEXIT >#68#return; 45527#L36-1 havoc main_#t~ret8#1; 45521#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45522#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 45487#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 45488#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 45493#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 45494#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 46352#$Ultimate##0 ~p := #in~p;~q := #in~q; 46357#L20 assume !(~p <= 0); 46356#L21 assume ~q <= 0;#res := 0; 46354#partsFINAL assume true; 46351#partsEXIT >#68#return; 46350#L36-1 havoc main_#t~ret8#1; 45523#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45524#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 45474#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 45475#$Ultimate##0 ~p := #in~p;~q := #in~q; 46247#L20 assume !(~p <= 0); 46246#L21 assume !(~q <= 0); 46245#L22 assume !(~q > ~p); 46219#L23 call #t~ret1 := parts(~p - ~q, ~q);< 46220#$Ultimate##0 ~p := #in~p;~q := #in~q; 46249#L20 assume ~p <= 0;#res := 1; 46243#partsFINAL assume true; 46218#partsEXIT >#64#return; 46211#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 46214#$Ultimate##0 ~p := #in~p;~q := #in~q; 46238#L20 assume !(~p <= 0); 46236#L21 assume ~q <= 0;#res := 0; 46229#partsFINAL assume true; 46210#partsEXIT >#66#return; 46203#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 46202#partsFINAL assume true; 46193#partsEXIT >#68#return; 46191#L36-1 havoc main_#t~ret8#1; 45801#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 45800#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 45555#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 45797#$Ultimate##0 ~p := #in~p;~q := #in~q; 45796#L20 assume !(~p <= 0); 45795#L21 assume !(~q <= 0); 45756#L22 assume !(~q > ~p); 45681#L23 [2023-02-15 14:14:59,981 INFO L750 eck$LassoCheckResult]: Loop: 45681#L23 call #t~ret1 := parts(~p - ~q, ~q);< 45754#$Ultimate##0 ~p := #in~p;~q := #in~q; 45762#L20 assume ~p <= 0;#res := 1; 45759#partsFINAL assume true; 45753#partsEXIT >#64#return; 45457#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 45659#$Ultimate##0 ~p := #in~p;~q := #in~q; 45694#L20 assume !(~p <= 0); 45686#L21 assume !(~q <= 0); 45680#L22 assume !(~q > ~p); 45681#L23 [2023-02-15 14:14:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2104916166, now seen corresponding path program 1 times [2023-02-15 14:14:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:59,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951575768] [2023-02-15 14:14:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 14:15:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-15 14:15:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,040 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 14:15:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951575768] [2023-02-15 14:15:00,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951575768] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184073532] [2023-02-15 14:15:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:00,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:00,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,042 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:00,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2023-02-15 14:15:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:00,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:15:00,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:00,127 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 14:15:00,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:00,179 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 14:15:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184073532] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:00,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-15 14:15:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630181069] [2023-02-15 14:15:00,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:00,180 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 328559132, now seen corresponding path program 2 times [2023-02-15 14:15:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:00,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447855892] [2023-02-15 14:15:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:00,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:00,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:00,291 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:00,291 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:00,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:00,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:00,292 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:00,292 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,292 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:00,292 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:00,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2023-02-15 14:15:00,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:00,292 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:00,292 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 14:15:00,294 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 14:15:00,295 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 14:15:00,297 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 14:15:00,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 14:15:00,343 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:00,343 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:00,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,345 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 14:15:00,347 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 14:15:00,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:00,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:00,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:00,369 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 14:15:00,372 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 14:15:00,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,374 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 14:15:00,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:00,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:00,395 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 14:15:00,403 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:00,403 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 14:15:00,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:00,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,407 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 14:15:00,409 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 14:15:00,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:00,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:00,431 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:00,431 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 14:15:00,434 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 14:15:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,435 INFO L229 MonitoredProcess]: Starting monitored process 89 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 14:15:00,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-02-15 14:15:00,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:00,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:00,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:00,460 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:00,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,464 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 14:15:00,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:00,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:00,494 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 14:15:00,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-02-15 14:15:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:00,522 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 14:15:00,524 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 14:15:00,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:00,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:03,914 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:03,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-02-15 14:15:03,920 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:03,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:03,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:03,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:03,920 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:03,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:03,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:03,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:03,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2023-02-15 14:15:03,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:03,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:03,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 14:15:03,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 14:15:03,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 14:15:03,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 14:15:03,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 14:15:03,979 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:03,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:03,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:03,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:03,980 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 14:15:03,982 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 14:15:03,984 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 14:15:03,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:03,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:03,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:03,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:03,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:03,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:03,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:03,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:04,001 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 14:15:04,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:04,003 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 14:15:04,004 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 14:15:04,006 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 14:15:04,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:04,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:04,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:04,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:04,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:04,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:04,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:04,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:04,031 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 14:15:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:04,033 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 14:15:04,034 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 14:15:04,036 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 14:15:04,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:04,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:04,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:04,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:04,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:04,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:04,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:04,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:04,059 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 14:15:04,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:04,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:04,061 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 14:15:04,063 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 14:15:04,064 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 14:15:04,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:04,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:04,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:04,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:04,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:04,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:04,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:04,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:04,094 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:04,095 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:04,097 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 14:15:04,098 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 14:15:04,099 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:04,099 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:04,099 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:04,099 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2023-02-15 14:15:04,102 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 14:15:04,102 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:04,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:04,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:04,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:15:04,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:04,387 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 14:15:04,389 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 14:15:04,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614 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 14:15:04,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614. 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 3409 states and 5224 transitions. Complement of second has 23 states. [2023-02-15 14:15:04,489 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 14:15:04,490 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 14:15:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2023-02-15 14:15:04,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 14:15:04,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:04,490 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:04,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:04,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:04,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:15:04,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:04,728 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 14:15:04,728 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 14:15:04,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614 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 14:15:04,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614. 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 3301 states and 5107 transitions. Complement of second has 23 states. [2023-02-15 14:15:04,840 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 14:15:04,840 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 14:15:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2023-02-15 14:15:04,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 49 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 14:15:04,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:04,841 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:04,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:04,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:04,987 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 14:15:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:15:05,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:05,116 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 14:15:05,117 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 14:15:05,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614 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 14:15:05,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1192 states and 1769 transitions. cyclomatic complexity: 614. 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 6071 states and 8254 transitions. Complement of second has 100 states. [2023-02-15 14:15:05,274 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 14:15:05,274 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 14:15:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2023-02-15 14:15:05,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 10 letters. [2023-02-15 14:15:05,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:05,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 71 letters. Loop has 10 letters. [2023-02-15 14:15:05,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:05,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 20 letters. [2023-02-15 14:15:05,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:05,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6071 states and 8254 transitions. [2023-02-15 14:15:05,341 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 145 [2023-02-15 14:15:05,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6071 states to 2310 states and 3139 transitions. [2023-02-15 14:15:05,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2023-02-15 14:15:05,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2023-02-15 14:15:05,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2310 states and 3139 transitions. [2023-02-15 14:15:05,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:05,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2310 states and 3139 transitions. [2023-02-15 14:15:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states and 3139 transitions. [2023-02-15 14:15:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1690. [2023-02-15 14:15:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1100 states have (on average 1.1418181818181818) internal successors, (1256), 1200 states have internal predecessors, (1256), 411 states have call successors, (465), 241 states have call predecessors, (465), 179 states have return successors, (554), 248 states have call predecessors, (554), 374 states have call successors, (554) [2023-02-15 14:15:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2275 transitions. [2023-02-15 14:15:05,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1690 states and 2275 transitions. [2023-02-15 14:15:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 14:15:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 14:15:05,438 INFO L87 Difference]: Start difference. First operand 1690 states and 2275 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 14:15:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:05,542 INFO L93 Difference]: Finished difference Result 1765 states and 2393 transitions. [2023-02-15 14:15:05,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1765 states and 2393 transitions. [2023-02-15 14:15:05,550 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 137 [2023-02-15 14:15:05,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1765 states to 1744 states and 2368 transitions. [2023-02-15 14:15:05,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2023-02-15 14:15:05,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2023-02-15 14:15:05,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1744 states and 2368 transitions. [2023-02-15 14:15:05,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:05,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1744 states and 2368 transitions. [2023-02-15 14:15:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states and 2368 transitions. [2023-02-15 14:15:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1694. [2023-02-15 14:15:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1103 states have (on average 1.14143245693563) internal successors, (1259), 1203 states have internal predecessors, (1259), 412 states have call successors, (466), 241 states have call predecessors, (466), 179 states have return successors, (555), 249 states have call predecessors, (555), 375 states have call successors, (555) [2023-02-15 14:15:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2280 transitions. [2023-02-15 14:15:05,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1694 states and 2280 transitions. [2023-02-15 14:15:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 14:15:05,585 INFO L428 stractBuchiCegarLoop]: Abstraction has 1694 states and 2280 transitions. [2023-02-15 14:15:05,585 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-15 14:15:05,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1694 states and 2280 transitions. [2023-02-15 14:15:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 115 [2023-02-15 14:15:05,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:05,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:05,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:05,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-15 14:15:05,591 INFO L748 eck$LassoCheckResult]: Stem: 64189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 64148#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; 64149#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 64146#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; 64147#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 64164#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64165#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 64681#$Ultimate##0 ~p := #in~p;~q := #in~q; 64684#L20 assume ~p <= 0;#res := 1; 64683#partsFINAL assume true; 64680#partsEXIT >#68#return; 64678#L36-1 havoc main_#t~ret8#1; 64192#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64193#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64677#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 64229#$Ultimate##0 ~p := #in~p;~q := #in~q; 64682#L20 assume ~p <= 0;#res := 1; 64679#partsFINAL assume true; 64676#partsEXIT >#68#return; 64422#L36-1 havoc main_#t~ret8#1; 64415#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64248#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64210#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 64224#$Ultimate##0 ~p := #in~p;~q := #in~q; 64221#L20 assume ~p <= 0;#res := 1; 64222#partsFINAL assume true; 64209#partsEXIT >#68#return; 64211#L36-1 havoc main_#t~ret8#1; 64487#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64485#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 64484#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 64207#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 64208#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64444#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 64445#$Ultimate##0 ~p := #in~p;~q := #in~q; 64465#L20 assume !(~p <= 0); 64464#L21 assume ~q <= 0;#res := 0; 64463#partsFINAL assume true; 64443#partsEXIT >#68#return; 64441#L36-1 havoc main_#t~ret8#1; 64432#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64429#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64352#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 65419#$Ultimate##0 ~p := #in~p;~q := #in~q; 65422#L20 assume !(~p <= 0); 65421#L21 assume ~q <= 0;#res := 0; 65420#partsFINAL assume true; 65418#partsEXIT >#68#return; 64894#L36-1 havoc main_#t~ret8#1; 64354#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64351#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 64340#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 64347#$Ultimate##0 ~p := #in~p;~q := #in~q; 64346#L20 assume !(~p <= 0); 64345#L21 assume !(~q <= 0); 64342#L22 assume !(~q > ~p); 64344#L23 call #t~ret1 := parts(~p - ~q, ~q);< 65616#$Ultimate##0 ~p := #in~p;~q := #in~q; 65622#L20 assume ~p <= 0;#res := 1; 65620#partsFINAL assume true; 65613#partsEXIT >#64#return; 65530#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 65537#$Ultimate##0 ~p := #in~p;~q := #in~q; 65534#L20 assume !(~p <= 0); 65532#L21 assume !(~q <= 0); 65531#L22 assume !(~q > ~p); 65481#L23 call #t~ret1 := parts(~p - ~q, ~q);< 65527#$Ultimate##0 ~p := #in~p;~q := #in~q; 65526#L20 assume !(~p <= 0); 65525#L21 assume !(~q <= 0); 65502#L22 assume ~q > ~p; 64155#L22-1 call #t~ret0 := parts(~p, ~p);< 65482#$Ultimate##0 ~p := #in~p;~q := #in~q; 65462#L20 assume !(~p <= 0); 65663#L21 assume !(~q <= 0); 65662#L22 assume !(~q > ~p); 64154#L23 [2023-02-15 14:15:05,591 INFO L750 eck$LassoCheckResult]: Loop: 64154#L23 call #t~ret1 := parts(~p - ~q, ~q);< 64158#$Ultimate##0 ~p := #in~p;~q := #in~q; 65664#L20 assume ~p <= 0;#res := 1; 65661#partsFINAL assume true; 65654#partsEXIT >#64#return; 65638#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 65649#$Ultimate##0 ~p := #in~p;~q := #in~q; 65647#L20 assume !(~p <= 0); 65645#L21 assume !(~q <= 0); 65642#L22 assume !(~q > ~p); 64156#L23 call #t~ret1 := parts(~p - ~q, ~q);< 65636#$Ultimate##0 ~p := #in~p;~q := #in~q; 65633#L20 assume !(~p <= 0); 65630#L21 assume !(~q <= 0); 65627#L22 assume !(~q > ~p); 64154#L23 [2023-02-15 14:15:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 340306903, now seen corresponding path program 2 times [2023-02-15 14:15:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:05,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106010485] [2023-02-15 14:15:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 14:15:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 14:15:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-15 14:15:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 108 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-02-15 14:15:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:05,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106010485] [2023-02-15 14:15:05,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106010485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:05,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98604135] [2023-02-15 14:15:05,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:05,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:05,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:05,653 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:05,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2023-02-15 14:15:05,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:05,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:05,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 14:15:05,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-02-15 14:15:05,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 14:15:05,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98604135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:15:05,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 14:15:05,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2023-02-15 14:15:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392186010] [2023-02-15 14:15:05,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:15:05,734 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash -159621075, now seen corresponding path program 3 times [2023-02-15 14:15:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:05,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819468965] [2023-02-15 14:15:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:05,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:05,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:05,979 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:05,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:05,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:05,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:05,980 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:05,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:05,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:05,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:05,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2023-02-15 14:15:05,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:05,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:05,981 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 14:15:05,982 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 14:15:05,983 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 14:15:05,985 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 14:15:05,986 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 14:15:06,054 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:06,055 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,056 INFO L229 MonitoredProcess]: Starting monitored process 98 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 14:15:06,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-02-15 14:15:06,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:06,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:06,081 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:06,081 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 14:15:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,121 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 14:15:06,123 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 14:15:06,125 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:06,125 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:06,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:06,131 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 14:15:06,134 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 14:15:06,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,135 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 14:15:06,137 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 14:15:06,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:06,139 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:06,155 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:06,156 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 14:15:06,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2023-02-15 14:15:06,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,159 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 14:15:06,160 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 14:15:06,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:06,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:06,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:06,178 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:15:06,181 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 14:15:06,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,182 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 14:15:06,184 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 14:15:06,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:06,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:06,205 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 14:15:06,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:06,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:06,206 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 14:15:06,208 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 14:15:06,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:06,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:08,702 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:08,707 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 14:15:08,707 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:08,707 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:08,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:08,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:08,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:08,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:08,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:08,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2023-02-15 14:15:08,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:08,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:08,708 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 14:15:08,709 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 14:15:08,711 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 14:15:08,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 14:15:08,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 14:15:08,760 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:08,760 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,761 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 14:15:08,762 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 14:15:08,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 14:15:08,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:08,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:08,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:08,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:08,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:08,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:08,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:08,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:08,774 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 14:15:08,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,775 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 14:15:08,777 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 14:15:08,779 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 14:15:08,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:08,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:08,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:08,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:08,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:08,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:08,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:08,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:08,788 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 14:15:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,789 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 14:15:08,791 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 14:15:08,792 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 14:15:08,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:08,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:08,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:08,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:08,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:08,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:08,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:08,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:08,802 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 14:15:08,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,805 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 14:15:08,806 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 14:15:08,807 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 14:15:08,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:08,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:08,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:08,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:08,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:08,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:08,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:08,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:08,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-02-15 14:15:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,833 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 14:15:08,835 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 14:15:08,836 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 14:15:08,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:08,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:08,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:08,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:08,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:08,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:08,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:08,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:08,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:08,847 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:08,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:08,850 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 14:15:08,850 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 14:15:08,851 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:08,851 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:08,851 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:08,851 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2023-02-15 14:15:08,854 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 14:15:08,854 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:08,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 14:15:08,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:15:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:09,173 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 14:15:09,174 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 14:15:09,174 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1694 states and 2280 transitions. cyclomatic complexity: 626 Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 14:15:09,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1694 states and 2280 transitions. cyclomatic complexity: 626. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 4235 states and 5389 transitions. Complement of second has 46 states. [2023-02-15 14:15:09,373 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 14:15:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 14:15:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2023-02-15 14:15:09,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 76 letters. Loop has 15 letters. [2023-02-15 14:15:09,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:09,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 91 letters. Loop has 15 letters. [2023-02-15 14:15:09,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:09,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 71 transitions. Stem has 76 letters. Loop has 30 letters. [2023-02-15 14:15:09,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:09,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4235 states and 5389 transitions. [2023-02-15 14:15:09,391 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 115 [2023-02-15 14:15:09,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4235 states to 2476 states and 3248 transitions. [2023-02-15 14:15:09,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2023-02-15 14:15:09,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-02-15 14:15:09,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2476 states and 3248 transitions. [2023-02-15 14:15:09,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:09,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2476 states and 3248 transitions. [2023-02-15 14:15:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states and 3248 transitions. [2023-02-15 14:15:09,470 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 14:15:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2378. [2023-02-15 14:15:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 1548 states have (on average 1.1311369509043927) internal successors, (1751), 1693 states have internal predecessors, (1751), 556 states have call successors, (613), 325 states have call predecessors, (613), 274 states have return successors, (760), 359 states have call predecessors, (760), 518 states have call successors, (760) [2023-02-15 14:15:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3124 transitions. [2023-02-15 14:15:09,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2378 states and 3124 transitions. [2023-02-15 14:15:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:15:09,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:15:09,487 INFO L87 Difference]: Start difference. First operand 2378 states and 3124 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 14:15:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:09,527 INFO L93 Difference]: Finished difference Result 1011 states and 1331 transitions. [2023-02-15 14:15:09,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1011 states and 1331 transitions. [2023-02-15 14:15:09,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2023-02-15 14:15:09,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1011 states to 978 states and 1284 transitions. [2023-02-15 14:15:09,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2023-02-15 14:15:09,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2023-02-15 14:15:09,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1284 transitions. [2023-02-15 14:15:09,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:09,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 978 states and 1284 transitions. [2023-02-15 14:15:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1284 transitions. [2023-02-15 14:15:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 977. [2023-02-15 14:15:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 635 states have (on average 1.1181102362204725) internal successors, (710), 692 states have internal predecessors, (710), 229 states have call successors, (259), 131 states have call predecessors, (259), 113 states have return successors, (313), 153 states have call predecessors, (313), 217 states have call successors, (313) [2023-02-15 14:15:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1282 transitions. [2023-02-15 14:15:09,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 977 states and 1282 transitions. [2023-02-15 14:15:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:15:09,550 INFO L428 stractBuchiCegarLoop]: Abstraction has 977 states and 1282 transitions. [2023-02-15 14:15:09,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-15 14:15:09,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 977 states and 1282 transitions. [2023-02-15 14:15:09,552 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2023-02-15 14:15:09,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:09,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:09,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:09,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-15 14:15:09,554 INFO L748 eck$LassoCheckResult]: Stem: 74127#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 74075#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; 74076#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 74068#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; 74069#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 74150#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74201#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74202#$Ultimate##0 ~p := #in~p;~q := #in~q; 74204#L20 assume ~p <= 0;#res := 1; 74203#partsFINAL assume true; 74200#partsEXIT >#68#return; 74199#L36-1 havoc main_#t~ret8#1; 74198#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74196#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74194#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74175#$Ultimate##0 ~p := #in~p;~q := #in~q; 74197#L20 assume ~p <= 0;#res := 1; 74195#partsFINAL assume true; 74193#partsEXIT >#68#return; 74192#L36-1 havoc main_#t~ret8#1; 74179#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74177#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74165#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74170#$Ultimate##0 ~p := #in~p;~q := #in~q; 74167#L20 assume ~p <= 0;#res := 1; 74164#partsFINAL assume true; 74166#partsEXIT >#68#return; 74153#L36-1 havoc main_#t~ret8#1; 74152#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74151#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 74081#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 74082#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 74163#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74155#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74156#$Ultimate##0 ~p := #in~p;~q := #in~q; 74372#L20 assume !(~p <= 0); 74354#L21 assume ~q <= 0;#res := 0; 74350#partsFINAL assume true; 74154#partsEXIT >#68#return; 74143#L36-1 havoc main_#t~ret8#1; 74128#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74091#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74070#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74071#$Ultimate##0 ~p := #in~p;~q := #in~q; 74457#L20 assume !(~p <= 0); 74455#L21 assume !(~q <= 0); 74453#L22 assume !(~q > ~p); 74454#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74573#$Ultimate##0 ~p := #in~p;~q := #in~q; 74598#L20 assume ~p <= 0;#res := 1; 74596#partsFINAL assume true; 74572#partsEXIT >#64#return; 74569#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 74570#$Ultimate##0 ~p := #in~p;~q := #in~q; 74599#L20 assume !(~p <= 0); 74597#L21 assume ~q <= 0;#res := 0; 74595#partsFINAL assume true; 74568#partsEXIT >#66#return; 74556#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 74551#partsFINAL assume true; 74545#partsEXIT >#68#return; 74144#L36-1 havoc main_#t~ret8#1; 74129#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74092#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 74093#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 74162#$Ultimate##0 ~p := #in~p;~q := #in~q; 74555#L20 assume !(~p <= 0); 74550#L21 assume !(~q <= 0); 74209#L22 assume !(~q > ~p); 74210#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74626#$Ultimate##0 ~p := #in~p;~q := #in~q; 74630#L20 assume ~p <= 0;#res := 1; 74629#partsFINAL assume true; 74623#partsEXIT >#64#return; 74188#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 74544#$Ultimate##0 ~p := #in~p;~q := #in~q; 74542#L20 assume !(~p <= 0); 74536#L21 assume !(~q <= 0); 74537#L22 assume !(~q > ~p); 74109#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74286#$Ultimate##0 ~p := #in~p;~q := #in~q; 74698#L20 assume !(~p <= 0); 74695#L21 assume !(~q <= 0); 74696#L22 assume !(~q > ~p); 74713#L23 [2023-02-15 14:15:09,554 INFO L750 eck$LassoCheckResult]: Loop: 74713#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74725#$Ultimate##0 ~p := #in~p;~q := #in~q; 74749#L20 assume ~p <= 0;#res := 1; 74747#partsFINAL assume true; 74723#partsEXIT >#64#return; 74712#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 74720#$Ultimate##0 ~p := #in~p;~q := #in~q; 74719#L20 assume !(~p <= 0); 74717#L21 assume !(~q <= 0); 74714#L22 assume !(~q > ~p); 74109#L23 call #t~ret1 := parts(~p - ~q, ~q);< 74286#$Ultimate##0 ~p := #in~p;~q := #in~q; 74698#L20 assume !(~p <= 0); 74695#L21 assume !(~q <= 0); 74696#L22 assume !(~q > ~p); 74713#L23 [2023-02-15 14:15:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 797969129, now seen corresponding path program 2 times [2023-02-15 14:15:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828351731] [2023-02-15 14:15:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 14:15:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 14:15:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-15 14:15:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 77 proven. 36 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 14:15:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:09,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828351731] [2023-02-15 14:15:09,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828351731] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:09,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567538927] [2023-02-15 14:15:09,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:15:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:09,660 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 14:15:09,661 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 14:15:09,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:15:09,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:09,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:09,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 103 proven. 34 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-02-15 14:15:09,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 77 proven. 36 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 14:15:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567538927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:09,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:09,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 14:15:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951043636] [2023-02-15 14:15:09,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:09,837 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash -159621075, now seen corresponding path program 4 times [2023-02-15 14:15:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130891508] [2023-02-15 14:15:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:09,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:09,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:10,025 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:10,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:10,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:10,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:10,025 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:10,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:10,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:10,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:10,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2023-02-15 14:15:10,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:10,025 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:10,025 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 14:15:10,027 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 14:15:10,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 14:15:10,039 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 14:15:10,040 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 14:15:10,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:10,082 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:10,084 INFO L229 MonitoredProcess]: Starting monitored process 111 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 14:15:10,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-02-15 14:15:10,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:10,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:10,094 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:10,094 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 14:15:10,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-02-15 14:15:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:10,098 INFO L229 MonitoredProcess]: Starting monitored process 112 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 14:15:10,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-02-15 14:15:10,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:10,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:10,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:10,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:10,118 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 14:15:10,120 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 14:15:10,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:10,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:12,594 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:12,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2023-02-15 14:15:12,598 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:12,598 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:12,598 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:12,598 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:12,598 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:12,598 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:12,598 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:12,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:12,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration17_Loop [2023-02-15 14:15:12,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:12,599 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:12,599 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 14:15:12,601 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 14:15:12,610 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 14:15:12,611 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 14:15:12,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 14:15:12,651 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:12,651 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:12,652 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 14:15:12,668 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 14:15:12,669 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 14:15:12,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:12,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:12,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:12,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:12,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:12,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:12,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:12,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:12,680 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 14:15:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:12,681 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 14:15:12,683 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 14:15:12,684 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 14:15:12,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:12,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:12,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:12,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:12,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:12,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:12,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:12,706 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:12,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:12,709 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:15:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:12,711 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 14:15:12,712 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 14:15:12,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:12,713 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:12,713 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:12,713 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2023-02-15 14:15:12,716 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 14:15:12,717 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:12,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:12,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:15:12,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:13,055 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 14:15:13,055 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 14:15:13,056 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:13,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322. 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1028 states and 1338 transitions. Complement of second has 14 states. [2023-02-15 14:15:13,129 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 14:15:13,129 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2023-02-15 14:15:13,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 84 letters. Loop has 15 letters. [2023-02-15 14:15:13,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:13,129 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:13,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:13,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:13,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:15:13,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:13,466 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 14:15:13,466 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 14:15:13,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:13,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322. 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1028 states and 1338 transitions. Complement of second has 14 states. [2023-02-15 14:15:13,534 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 14:15:13,534 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2023-02-15 14:15:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 84 letters. Loop has 15 letters. [2023-02-15 14:15:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:13,535 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:15:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:13,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:13,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:13,761 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 14:15:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:13,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 14:15:13,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:13,899 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 14:15:13,899 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 14:15:13,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:14,109 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1282 transitions. cyclomatic complexity: 322. 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 4617 states and 6044 transitions. Complement of second has 271 states. [2023-02-15 14:15:14,110 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 14:15:14,110 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, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 14:15:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 79 transitions. [2023-02-15 14:15:14,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 84 letters. Loop has 15 letters. [2023-02-15 14:15:14,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:14,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 99 letters. Loop has 15 letters. [2023-02-15 14:15:14,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:14,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 79 transitions. Stem has 84 letters. Loop has 30 letters. [2023-02-15 14:15:14,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:14,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4617 states and 6044 transitions. [2023-02-15 14:15:14,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-15 14:15:14,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4617 states to 1184 states and 1574 transitions. [2023-02-15 14:15:14,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2023-02-15 14:15:14,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2023-02-15 14:15:14,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1184 states and 1574 transitions. [2023-02-15 14:15:14,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:14,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1184 states and 1574 transitions. [2023-02-15 14:15:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states and 1574 transitions. [2023-02-15 14:15:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1021. [2023-02-15 14:15:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 675 states have (on average 1.1362962962962964) internal successors, (767), 741 states have internal predecessors, (767), 226 states have call successors, (233), 132 states have call predecessors, (233), 120 states have return successors, (310), 147 states have call predecessors, (310), 226 states have call successors, (310) [2023-02-15 14:15:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1310 transitions. [2023-02-15 14:15:14,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1021 states and 1310 transitions. [2023-02-15 14:15:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 14:15:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-02-15 14:15:14,152 INFO L87 Difference]: Start difference. First operand 1021 states and 1310 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 9 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 14:15:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:14,293 INFO L93 Difference]: Finished difference Result 960 states and 1206 transitions. [2023-02-15 14:15:14,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 960 states and 1206 transitions. [2023-02-15 14:15:14,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-15 14:15:14,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 960 states to 960 states and 1206 transitions. [2023-02-15 14:15:14,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2023-02-15 14:15:14,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 205 [2023-02-15 14:15:14,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 960 states and 1206 transitions. [2023-02-15 14:15:14,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:14,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 960 states and 1206 transitions. [2023-02-15 14:15:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states and 1206 transitions. [2023-02-15 14:15:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 949. [2023-02-15 14:15:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 633 states have (on average 1.1216429699842023) internal successors, (710), 693 states have internal predecessors, (710), 205 states have call successors, (213), 123 states have call predecessors, (213), 111 states have return successors, (272), 132 states have call predecessors, (272), 205 states have call successors, (272) [2023-02-15 14:15:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1195 transitions. [2023-02-15 14:15:14,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 949 states and 1195 transitions. [2023-02-15 14:15:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 14:15:14,316 INFO L428 stractBuchiCegarLoop]: Abstraction has 949 states and 1195 transitions. [2023-02-15 14:15:14,316 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-15 14:15:14,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 949 states and 1195 transitions. [2023-02-15 14:15:14,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-02-15 14:15:14,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:14,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:14,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:14,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:14,319 INFO L748 eck$LassoCheckResult]: Stem: 85562#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 85520#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; 85521#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 85518#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; 85519#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 85587#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85670#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85671#$Ultimate##0 ~p := #in~p;~q := #in~q; 85673#L20 assume ~p <= 0;#res := 1; 85672#partsFINAL assume true; 85669#partsEXIT >#68#return; 85668#L36-1 havoc main_#t~ret8#1; 85667#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85664#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85660#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85661#$Ultimate##0 ~p := #in~p;~q := #in~q; 85666#L20 assume ~p <= 0;#res := 1; 85663#partsFINAL assume true; 85659#partsEXIT >#68#return; 85641#L36-1 havoc main_#t~ret8#1; 85620#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85619#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85613#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85617#$Ultimate##0 ~p := #in~p;~q := #in~q; 85612#L20 assume ~p <= 0;#res := 1; 85614#partsFINAL assume true; 85729#partsEXIT >#68#return; 85728#L36-1 havoc main_#t~ret8#1; 85727#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85726#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 85725#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 85724#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 85598#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85596#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85604#$Ultimate##0 ~p := #in~p;~q := #in~q; 85602#L20 assume !(~p <= 0); 85603#L21 assume ~q <= 0;#res := 0; 85595#partsFINAL assume true; 85597#partsEXIT >#68#return; 85579#L36-1 havoc main_#t~ret8#1; 85580#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85537#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85538#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85705#$Ultimate##0 ~p := #in~p;~q := #in~q; 85722#L20 assume !(~p <= 0); 85721#L21 assume !(~q <= 0); 85719#L22 assume !(~q > ~p); 85713#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85714#$Ultimate##0 ~p := #in~p;~q := #in~q; 85718#L20 assume ~p <= 0;#res := 1; 85716#partsFINAL assume true; 85712#partsEXIT >#64#return; 85709#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85710#$Ultimate##0 ~p := #in~p;~q := #in~q; 85717#L20 assume !(~p <= 0); 85715#L21 assume ~q <= 0;#res := 0; 85711#partsFINAL assume true; 85708#partsEXIT >#66#return; 85707#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85706#partsFINAL assume true; 85704#partsEXIT >#68#return; 85703#L36-1 havoc main_#t~ret8#1; 85702#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85701#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85609#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85699#$Ultimate##0 ~p := #in~p;~q := #in~q; 85698#L20 assume !(~p <= 0); 85697#L21 assume !(~q <= 0); 85696#L22 assume ~q > ~p; 85624#L22-1 call #t~ret0 := parts(~p, ~p);< 85692#$Ultimate##0 ~p := #in~p;~q := #in~q; 85690#L20 assume !(~p <= 0); 85687#L21 assume !(~q <= 0); 85684#L22 assume !(~q > ~p); 85653#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85655#$Ultimate##0 ~p := #in~p;~q := #in~q; 85810#L20 assume ~p <= 0;#res := 1; 85808#partsFINAL assume true; 85806#partsEXIT >#64#return; 85639#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85640#$Ultimate##0 ~p := #in~p;~q := #in~q; 86358#L20 assume !(~p <= 0); 86357#L21 assume !(~q <= 0); 86356#L22 assume !(~q > ~p); 85646#L23 call #t~ret1 := parts(~p - ~q, ~q);< 86353#$Ultimate##0 ~p := #in~p;~q := #in~q; 86351#L20 assume !(~p <= 0); 86348#L21 assume !(~q <= 0); 86338#L22 assume !(~q > ~p); 86334#L23 call #t~ret1 := parts(~p - ~q, ~q);< 86336#$Ultimate##0 ~p := #in~p;~q := #in~q; 86347#L20 assume ~p <= 0;#res := 1; 86346#partsFINAL assume true; 86333#partsEXIT >#64#return; 85547#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85514#$Ultimate##0 ~p := #in~p;~q := #in~q; 85551#L20 assume !(~p <= 0); 85546#L21 assume ~q <= 0;#res := 0; 85549#partsFINAL assume true; 86330#partsEXIT >#66#return; 86320#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 86321#partsFINAL assume true; 85645#partsEXIT >#64#return; 85643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85638#$Ultimate##0 ~p := #in~p;~q := #in~q; 85675#L20 assume !(~p <= 0); 85676#L21 assume ~q <= 0;#res := 0; 85642#partsFINAL assume true; 85644#partsEXIT >#66#return; 85677#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85649#partsFINAL assume true; 85650#partsEXIT >#66#return; 85628#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85627#partsFINAL assume true; 85621#partsEXIT >#62#return; 85625#L22-2 #res := #t~ret0;havoc #t~ret0; 85608#partsFINAL assume true; 85611#partsEXIT >#68#return; 85590#L36-1 [2023-02-15 14:15:14,319 INFO L750 eck$LassoCheckResult]: Loop: 85590#L36-1 havoc main_#t~ret8#1; 85589#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85588#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 85535#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 85536#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 85601#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85592#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85594#$Ultimate##0 ~p := #in~p;~q := #in~q; 85723#L20 assume !(~p <= 0); 85599#L21 assume ~q <= 0;#res := 0; 85600#partsFINAL assume true; 85591#partsEXIT >#68#return; 85593#L36-1 havoc main_#t~ret8#1; 85563#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85564#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85522#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85523#$Ultimate##0 ~p := #in~p;~q := #in~q; 85918#L20 assume !(~p <= 0); 85917#L21 assume !(~q <= 0); 85916#L22 assume !(~q > ~p); 85909#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85910#$Ultimate##0 ~p := #in~p;~q := #in~q; 85920#L20 assume ~p <= 0;#res := 1; 85919#partsFINAL assume true; 85908#partsEXIT >#64#return; 85834#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85837#$Ultimate##0 ~p := #in~p;~q := #in~q; 85898#L20 assume !(~p <= 0); 85896#L21 assume ~q <= 0;#res := 0; 85839#partsFINAL assume true; 85833#partsEXIT >#66#return; 85832#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85825#partsFINAL assume true; 85821#partsEXIT >#68#return; 85818#L36-1 havoc main_#t~ret8#1; 85817#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 85539#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 85540#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 85607#$Ultimate##0 ~p := #in~p;~q := #in~q; 85802#L20 assume !(~p <= 0); 85803#L21 assume !(~q <= 0); 85730#L22 assume ~q > ~p; 85623#L22-1 call #t~ret0 := parts(~p, ~p);< 85626#$Ultimate##0 ~p := #in~p;~q := #in~q; 85695#L20 assume !(~p <= 0); 85694#L21 assume !(~q <= 0); 85691#L22 assume !(~q > ~p); 85680#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85681#$Ultimate##0 ~p := #in~p;~q := #in~q; 85809#L20 assume ~p <= 0;#res := 1; 85807#partsFINAL assume true; 85805#partsEXIT >#64#return; 85633#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 86001#$Ultimate##0 ~p := #in~p;~q := #in~q; 86345#L20 assume !(~p <= 0); 86344#L21 assume !(~q <= 0); 86343#L22 assume !(~q > ~p); 85647#L23 call #t~ret1 := parts(~p - ~q, ~q);< 86342#$Ultimate##0 ~p := #in~p;~q := #in~q; 86341#L20 assume !(~p <= 0); 86339#L21 assume !(~q <= 0); 86328#L22 assume !(~q > ~p); 86334#L23 call #t~ret1 := parts(~p - ~q, ~q);< 86336#$Ultimate##0 ~p := #in~p;~q := #in~q; 86347#L20 assume ~p <= 0;#res := 1; 86346#partsFINAL assume true; 86333#partsEXIT >#64#return; 85547#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85514#$Ultimate##0 ~p := #in~p;~q := #in~q; 85551#L20 assume !(~p <= 0); 85546#L21 assume ~q <= 0;#res := 0; 85549#partsFINAL assume true; 86330#partsEXIT >#66#return; 86320#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 86321#partsFINAL assume true; 85645#partsEXIT >#64#return; 85643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85638#$Ultimate##0 ~p := #in~p;~q := #in~q; 85675#L20 assume !(~p <= 0); 85676#L21 assume ~q <= 0;#res := 0; 85642#partsFINAL assume true; 85644#partsEXIT >#66#return; 85677#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85649#partsFINAL assume true; 85650#partsEXIT >#66#return; 85628#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 85627#partsFINAL assume true; 85621#partsEXIT >#62#return; 85615#L22-2 #res := #t~ret0;havoc #t~ret0; 85616#partsFINAL assume true; 85605#partsEXIT >#68#return; 85590#L36-1 [2023-02-15 14:15:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -329748821, now seen corresponding path program 1 times [2023-02-15 14:15:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:14,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005251843] [2023-02-15 14:15:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 14:15:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 14:15:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 14:15:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 115 proven. 76 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2023-02-15 14:15:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:14,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005251843] [2023-02-15 14:15:14,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005251843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:14,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902720134] [2023-02-15 14:15:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:14,550 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 14:15:14,552 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 14:15:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:14,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 14:15:14,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 118 proven. 76 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2023-02-15 14:15:14,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 118 proven. 78 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-02-15 14:15:14,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902720134] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:14,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:14,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2023-02-15 14:15:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223439492] [2023-02-15 14:15:14,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:14,967 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 390448456, now seen corresponding path program 1 times [2023-02-15 14:15:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627862022] [2023-02-15 14:15:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-15 14:15:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:15,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627862022] [2023-02-15 14:15:15,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627862022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:15,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108508580] [2023-02-15 14:15:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:15,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:15,303 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 14:15:15,305 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 14:15:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:15,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:15,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 77 proven. 125 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-02-15 14:15:15,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 80 proven. 124 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-02-15 14:15:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108508580] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:15,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2023-02-15 14:15:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564483875] [2023-02-15 14:15:15,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:15,854 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 14:15:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2023-02-15 14:15:15,855 INFO L87 Difference]: Start difference. First operand 949 states and 1195 transitions. cyclomatic complexity: 260 Second operand has 27 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 17 states have call successors, (24), 1 states have call predecessors, (24), 9 states have return successors, (26), 15 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-15 14:15:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:16,584 INFO L93 Difference]: Finished difference Result 1094 states and 1365 transitions. [2023-02-15 14:15:16,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1094 states and 1365 transitions. [2023-02-15 14:15:16,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-02-15 14:15:16,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1094 states to 804 states and 939 transitions. [2023-02-15 14:15:16,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2023-02-15 14:15:16,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2023-02-15 14:15:16,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 804 states and 939 transitions. [2023-02-15 14:15:16,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:16,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 804 states and 939 transitions. [2023-02-15 14:15:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states and 939 transitions. [2023-02-15 14:15:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 696. [2023-02-15 14:15:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 492 states have (on average 1.048780487804878) internal successors, (516), 509 states have internal predecessors, (516), 114 states have call successors, (123), 91 states have call predecessors, (123), 90 states have return successors, (162), 95 states have call predecessors, (162), 114 states have call successors, (162) [2023-02-15 14:15:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 801 transitions. [2023-02-15 14:15:16,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 696 states and 801 transitions. [2023-02-15 14:15:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-15 14:15:16,599 INFO L428 stractBuchiCegarLoop]: Abstraction has 696 states and 801 transitions. [2023-02-15 14:15:16,599 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-02-15 14:15:16,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 696 states and 801 transitions. [2023-02-15 14:15:16,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:16,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:16,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:16,601 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 14:15:16,601 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 14:15:16,602 INFO L748 eck$LassoCheckResult]: Stem: 89352#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 89313#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; 89314#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 89311#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; 89312#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 89370#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89440#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89441#$Ultimate##0 ~p := #in~p;~q := #in~q; 89443#L20 assume ~p <= 0;#res := 1; 89442#partsFINAL assume true; 89439#partsEXIT >#68#return; 89438#L36-1 havoc main_#t~ret8#1; 89437#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89434#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89430#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89431#$Ultimate##0 ~p := #in~p;~q := #in~q; 89436#L20 assume ~p <= 0;#res := 1; 89433#partsFINAL assume true; 89429#partsEXIT >#68#return; 89426#L36-1 havoc main_#t~ret8#1; 89403#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89402#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89390#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89400#$Ultimate##0 ~p := #in~p;~q := #in~q; 89397#L20 assume ~p <= 0;#res := 1; 89398#partsFINAL assume true; 89389#partsEXIT >#68#return; 89391#L36-1 havoc main_#t~ret8#1; 89507#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89506#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 89322#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 89323#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 89386#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89379#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89387#$Ultimate##0 ~p := #in~p;~q := #in~q; 89388#L20 assume !(~p <= 0); 89383#L21 assume ~q <= 0;#res := 0; 89378#partsFINAL assume true; 89380#partsEXIT >#68#return; 89373#L36-1 havoc main_#t~ret8#1; 89374#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89381#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89382#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89472#$Ultimate##0 ~p := #in~p;~q := #in~q; 89523#L20 assume !(~p <= 0); 89522#L21 assume !(~q <= 0); 89495#L22 assume !(~q > ~p); 89496#L23 call #t~ret1 := parts(~p - ~q, ~q);< 89889#$Ultimate##0 ~p := #in~p;~q := #in~q; 89901#L20 assume ~p <= 0;#res := 1; 89900#partsFINAL assume true; 89888#partsEXIT >#64#return; 89881#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 89882#$Ultimate##0 ~p := #in~p;~q := #in~q; 89896#L20 assume !(~p <= 0); 89887#L21 assume ~q <= 0;#res := 0; 89886#partsFINAL assume true; 89880#partsEXIT >#66#return; 89878#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 89876#partsFINAL assume true; 89873#partsEXIT >#68#return; 89365#L36-1 havoc main_#t~ret8#1; 89355#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89326#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89327#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89392#$Ultimate##0 ~p := #in~p;~q := #in~q; 89922#L20 assume !(~p <= 0); 89908#L21 assume !(~q <= 0); 89909#L22 assume ~q > ~p; 89329#L22-1 call #t~ret0 := parts(~p, ~p);< 89349#$Ultimate##0 ~p := #in~p;~q := #in~q; 89917#L20 assume !(~p <= 0); 89918#L21 assume !(~q <= 0); 89328#L22 assume !(~q > ~p); 89330#L23 call #t~ret1 := parts(~p - ~q, ~q);< 89978#$Ultimate##0 ~p := #in~p;~q := #in~q; 89980#L20 assume ~p <= 0;#res := 1; 89979#partsFINAL assume true; 89977#partsEXIT >#64#return; 89731#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 89732#$Ultimate##0 ~p := #in~p;~q := #in~q; 89989#L20 assume !(~p <= 0); 89988#L21 assume ~q <= 0;#res := 0; 89956#partsFINAL assume true; 89730#partsEXIT >#66#return; 89726#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 89723#partsFINAL assume true; 89703#partsEXIT >#62#return; 89708#L22-2 #res := #t~ret0;havoc #t~ret0; 89698#partsFINAL assume true; 89692#partsEXIT >#68#return; 89363#L36-1 [2023-02-15 14:15:16,602 INFO L750 eck$LassoCheckResult]: Loop: 89363#L36-1 havoc main_#t~ret8#1; 89364#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89371#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 89372#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 89502#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 89324#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89325#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89377#$Ultimate##0 ~p := #in~p;~q := #in~q; 89384#L20 assume !(~p <= 0); 89385#L21 assume ~q <= 0;#res := 0; 89517#partsFINAL assume true; 89375#partsEXIT >#68#return; 89376#L36-1 havoc main_#t~ret8#1; 89353#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89354#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89315#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89316#$Ultimate##0 ~p := #in~p;~q := #in~q; 89511#L20 assume !(~p <= 0); 89510#L21 assume !(~q <= 0); 89508#L22 assume !(~q > ~p); 89509#L23 call #t~ret1 := parts(~p - ~q, ~q);< 89856#$Ultimate##0 ~p := #in~p;~q := #in~q; 89860#L20 assume ~p <= 0;#res := 1; 89858#partsFINAL assume true; 89855#partsEXIT >#64#return; 89852#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 89853#$Ultimate##0 ~p := #in~p;~q := #in~q; 89859#L20 assume !(~p <= 0); 89857#L21 assume ~q <= 0;#res := 0; 89854#partsFINAL assume true; 89851#partsEXIT >#66#return; 89850#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 89848#partsFINAL assume true; 89846#partsEXIT >#68#return; 89843#L36-1 havoc main_#t~ret8#1; 89702#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 89700#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 89654#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 89690#$Ultimate##0 ~p := #in~p;~q := #in~q; 89832#L20 assume !(~p <= 0); 89827#L21 assume !(~q <= 0); 89824#L22 assume ~q > ~p; 89706#L22-1 call #t~ret0 := parts(~p, ~p);< 89709#$Ultimate##0 ~p := #in~p;~q := #in~q; 89921#L20 assume !(~p <= 0); 89906#L21 assume !(~q <= 0); 89907#L22 assume !(~q > ~p); 89973#L23 call #t~ret1 := parts(~p - ~q, ~q);< 89830#$Ultimate##0 ~p := #in~p;~q := #in~q; 89976#L20 assume ~p <= 0;#res := 1; 89975#partsFINAL assume true; 89972#partsEXIT >#64#return; 89731#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 89732#$Ultimate##0 ~p := #in~p;~q := #in~q; 89989#L20 assume !(~p <= 0); 89988#L21 assume ~q <= 0;#res := 0; 89956#partsFINAL assume true; 89730#partsEXIT >#66#return; 89726#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 89723#partsFINAL assume true; 89703#partsEXIT >#62#return; 89701#L22-2 #res := #t~ret0;havoc #t~ret0; 89699#partsFINAL assume true; 89693#partsEXIT >#68#return; 89363#L36-1 [2023-02-15 14:15:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 2 times [2023-02-15 14:15:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:16,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232315818] [2023-02-15 14:15:16,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:16,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:16,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1566345406, now seen corresponding path program 2 times [2023-02-15 14:15:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:16,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935365387] [2023-02-15 14:15:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:16,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:16,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -432935168, now seen corresponding path program 3 times [2023-02-15 14:15:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:16,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872553146] [2023-02-15 14:15:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 14:15:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 14:15:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 14:15:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-02-15 14:15:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-02-15 14:15:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-02-15 14:15:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:16,783 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 14:15:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872553146] [2023-02-15 14:15:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872553146] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615978102] [2023-02-15 14:15:16,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:15:16,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:16,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:16,786 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 14:15:16,787 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 14:15:16,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 14:15:16,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:16,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:15:16,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 176 proven. 55 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-02-15 14:15:16,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 169 proven. 62 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-02-15 14:15:17,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615978102] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:17,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:17,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2023-02-15 14:15:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504041152] [2023-02-15 14:15:17,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:17,659 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:17,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:17,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:17,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:17,659 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:17,660 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,660 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:17,660 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:17,660 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2023-02-15 14:15:17,660 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:17,660 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:17,660 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 14:15:17,662 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 14:15:17,663 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 14:15:17,665 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 14:15:17,669 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 14:15:17,701 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:17,701 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,703 INFO L229 MonitoredProcess]: Starting monitored process 120 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 14:15:17,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-02-15 14:15:17,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:17,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,714 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:17,714 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 14:15:17,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:17,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,719 INFO L229 MonitoredProcess]: Starting monitored process 121 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 14:15:17,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-02-15 14:15:17,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:17,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:17,729 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 14:15:17,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2023-02-15 14:15:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,734 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 14:15:17,735 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 14:15:17,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:17,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,745 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:17,745 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 14:15:17,747 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 14:15:17,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,749 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 14:15:17,750 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 14:15:17,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:17,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:17,764 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 14:15:17,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2023-02-15 14:15:17,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,768 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 14:15:17,770 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 14:15:17,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:17,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2023-02-15 14:15:17,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,782 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 14:15:17,784 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 14:15:17,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:17,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:17,846 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:17,850 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 14:15:17,850 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:17,850 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:17,850 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:17,850 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:17,850 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:17,850 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,850 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:17,850 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:17,850 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2023-02-15 14:15:17,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:17,850 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:17,851 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 14:15:17,853 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 14:15:17,854 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 14:15:17,855 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 14:15:17,860 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 14:15:17,892 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:17,892 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,893 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 14:15:17,895 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 14:15:17,897 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 14:15:17,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:17,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:17,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:17,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:17,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:17,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:17,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:17,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:17,907 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 14:15:17,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,909 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 14:15:17,911 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 14:15:17,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 14:15:17,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:17,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:17,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:17,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:17,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:17,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:17,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:17,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:17,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2023-02-15 14:15:17,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,933 INFO L229 MonitoredProcess]: Starting monitored process 128 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 14:15:17,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-02-15 14:15:17,936 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 14:15:17,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:17,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:17,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:17,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:17,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:17,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:17,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:17,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:17,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:17,965 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 14:15:17,967 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 14:15:17,969 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 14:15:17,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:17,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:17,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:17,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:17,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:17,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:17,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:17,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:17,995 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 14:15:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,009 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 14:15:18,010 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 14:15:18,012 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 14:15:18,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:18,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:18,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:18,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:18,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:18,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:18,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:18,032 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:18,035 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:18,035 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:18,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:18,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:18,043 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 14:15:18,044 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 14:15:18,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:18,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:18,046 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:18,046 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 14:15:18,049 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 14:15:18,050 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:18,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:18,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:18,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 14:15:18,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:18,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2023-02-15 14:15:18,572 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 14:15:18,573 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 14:15:18,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 696 states and 801 transitions. cyclomatic complexity: 117 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 14:15:18,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 696 states and 801 transitions. cyclomatic complexity: 117. 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 1633 states and 1892 transitions. Complement of second has 53 states. [2023-02-15 14:15:18,754 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 14:15:18,755 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 14:15:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2023-02-15 14:15:18,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 91 letters. Loop has 64 letters. [2023-02-15 14:15:18,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 155 letters. Loop has 64 letters. [2023-02-15 14:15:18,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 91 letters. Loop has 128 letters. [2023-02-15 14:15:18,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:18,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1633 states and 1892 transitions. [2023-02-15 14:15:18,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:15:18,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1633 states to 1605 states and 1864 transitions. [2023-02-15 14:15:18,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2023-02-15 14:15:18,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2023-02-15 14:15:18,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1605 states and 1864 transitions. [2023-02-15 14:15:18,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:18,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1605 states and 1864 transitions. [2023-02-15 14:15:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states and 1864 transitions. [2023-02-15 14:15:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1466. [2023-02-15 14:15:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1036 states have (on average 1.0511583011583012) internal successors, (1089), 1071 states have internal predecessors, (1089), 247 states have call successors, (269), 189 states have call predecessors, (269), 183 states have return successors, (345), 205 states have call predecessors, (345), 247 states have call successors, (345) [2023-02-15 14:15:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1703 transitions. [2023-02-15 14:15:18,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1466 states and 1703 transitions. [2023-02-15 14:15:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 14:15:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-02-15 14:15:18,788 INFO L87 Difference]: Start difference. First operand 1466 states and 1703 transitions. Second operand has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 14 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (19), 12 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-15 14:15:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:19,088 INFO L93 Difference]: Finished difference Result 1505 states and 1762 transitions. [2023-02-15 14:15:19,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1505 states and 1762 transitions. [2023-02-15 14:15:19,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-02-15 14:15:19,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1505 states to 798 states and 927 transitions. [2023-02-15 14:15:19,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2023-02-15 14:15:19,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-02-15 14:15:19,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 798 states and 927 transitions. [2023-02-15 14:15:19,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:19,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 798 states and 927 transitions. [2023-02-15 14:15:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states and 927 transitions. [2023-02-15 14:15:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 762. [2023-02-15 14:15:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 542 states have (on average 1.0461254612546125) internal successors, (567), 559 states have internal predecessors, (567), 126 states have call successors, (137), 98 states have call predecessors, (137), 94 states have return successors, (175), 104 states have call predecessors, (175), 126 states have call successors, (175) [2023-02-15 14:15:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 879 transitions. [2023-02-15 14:15:19,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 762 states and 879 transitions. [2023-02-15 14:15:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 14:15:19,104 INFO L428 stractBuchiCegarLoop]: Abstraction has 762 states and 879 transitions. [2023-02-15 14:15:19,104 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-02-15 14:15:19,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 879 transitions. [2023-02-15 14:15:19,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:19,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:19,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:19,109 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 14:15:19,109 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 14:15:19,110 INFO L748 eck$LassoCheckResult]: Stem: 96362#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 96321#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; 96322#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 96319#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; 96320#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96413#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96410#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96411#$Ultimate##0 ~p := #in~p;~q := #in~q; 96414#L20 assume ~p <= 0;#res := 1; 96412#partsFINAL assume true; 96409#partsEXIT >#68#return; 96407#L36-1 havoc main_#t~ret8#1; 96406#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96403#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96398#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96400#$Ultimate##0 ~p := #in~p;~q := #in~q; 96404#L20 assume ~p <= 0;#res := 1; 96401#partsFINAL assume true; 96397#partsEXIT >#68#return; 96396#L36-1 havoc main_#t~ret8#1; 96395#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96393#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96389#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96390#$Ultimate##0 ~p := #in~p;~q := #in~q; 96394#L20 assume ~p <= 0;#res := 1; 96392#partsFINAL assume true; 96388#partsEXIT >#68#return; 96387#L36-1 havoc main_#t~ret8#1; 96386#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96385#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 96333#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96334#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96384#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96587#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96588#$Ultimate##0 ~p := #in~p;~q := #in~q; 96612#L20 assume !(~p <= 0); 96603#L21 assume ~q <= 0;#res := 0; 96600#partsFINAL assume true; 96586#partsEXIT >#68#return; 96584#L36-1 havoc main_#t~ret8#1; 96582#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96581#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96578#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96579#$Ultimate##0 ~p := #in~p;~q := #in~q; 96629#L20 assume !(~p <= 0); 96627#L21 assume !(~q <= 0); 96625#L22 assume !(~q > ~p); 96617#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96618#$Ultimate##0 ~p := #in~p;~q := #in~q; 96623#L20 assume ~p <= 0;#res := 1; 96621#partsFINAL assume true; 96616#partsEXIT >#64#return; 96614#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96615#$Ultimate##0 ~p := #in~p;~q := #in~q; 96624#L20 assume !(~p <= 0); 96622#L21 assume ~q <= 0;#res := 0; 96620#partsFINAL assume true; 96613#partsEXIT >#66#return; 96604#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96596#partsFINAL assume true; 96577#partsEXIT >#68#return; 96575#L36-1 havoc main_#t~ret8#1; 96573#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96564#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96429#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96568#$Ultimate##0 ~p := #in~p;~q := #in~q; 96567#L20 assume !(~p <= 0); 96566#L21 assume !(~q <= 0); 96565#L22 assume ~q > ~p; 96449#L22-1 call #t~ret0 := parts(~p, ~p);< 96448#$Ultimate##0 ~p := #in~p;~q := #in~q; 96450#L20 assume !(~p <= 0); 96557#L21 assume !(~q <= 0); 96554#L22 assume !(~q > ~p); 96541#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96542#$Ultimate##0 ~p := #in~p;~q := #in~q; 96555#L20 assume ~p <= 0;#res := 1; 96552#partsFINAL assume true; 96540#partsEXIT >#64#return; 96534#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96535#$Ultimate##0 ~p := #in~p;~q := #in~q; 96549#L20 assume !(~p <= 0); 96547#L21 assume ~q <= 0;#res := 0; 96537#partsFINAL assume true; 96533#partsEXIT >#66#return; 96531#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96528#partsFINAL assume true; 96522#partsEXIT >#62#return; 96519#L22-2 #res := #t~ret0;havoc #t~ret0; 96520#partsFINAL assume true; 96428#partsEXIT >#68#return; 96371#L36-1 [2023-02-15 14:15:19,110 INFO L750 eck$LassoCheckResult]: Loop: 96371#L36-1 havoc main_#t~ret8#1; 96372#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96415#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 96331#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 96332#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 96383#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96419#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96420#$Ultimate##0 ~p := #in~p;~q := #in~q; 96427#L20 assume !(~p <= 0); 96425#L21 assume ~q <= 0;#res := 0; 96426#partsFINAL assume true; 96418#partsEXIT >#68#return; 96416#L36-1 havoc main_#t~ret8#1; 96417#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96423#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96424#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96649#$Ultimate##0 ~p := #in~p;~q := #in~q; 96664#L20 assume !(~p <= 0); 96662#L21 assume !(~q <= 0); 96661#L22 assume !(~q > ~p); 96659#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96660#$Ultimate##0 ~p := #in~p;~q := #in~q; 96906#L20 assume !(~p <= 0); 96905#L21 assume !(~q <= 0); 96904#L22 assume !(~q > ~p); 96897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96898#$Ultimate##0 ~p := #in~p;~q := #in~q; 96992#L20 assume ~p <= 0;#res := 1; 96991#partsFINAL assume true; 96990#partsEXIT >#64#return; 96889#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96891#$Ultimate##0 ~p := #in~p;~q := #in~q; 96912#L20 assume !(~p <= 0); 96911#L21 assume ~q <= 0;#res := 0; 96907#partsFINAL assume true; 96888#partsEXIT >#66#return; 96885#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96674#partsFINAL assume true; 96658#partsEXIT >#64#return; 96653#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96654#$Ultimate##0 ~p := #in~p;~q := #in~q; 96670#L20 assume !(~p <= 0); 96669#L21 assume ~q <= 0;#res := 0; 96657#partsFINAL assume true; 96652#partsEXIT >#66#return; 96651#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96650#partsFINAL assume true; 96648#partsEXIT >#68#return; 96647#L36-1 havoc main_#t~ret8#1; 96365#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96343#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96325#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96326#$Ultimate##0 ~p := #in~p;~q := #in~q; 96725#L20 assume !(~p <= 0); 96722#L21 assume !(~q <= 0); 96717#L22 assume !(~q > ~p); 96702#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96703#$Ultimate##0 ~p := #in~p;~q := #in~q; 96715#L20 assume ~p <= 0;#res := 1; 96711#partsFINAL assume true; 96701#partsEXIT >#64#return; 96695#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96698#$Ultimate##0 ~p := #in~p;~q := #in~q; 96894#L20 assume !(~p <= 0); 96895#L21 assume !(~q <= 0); 96769#L22 assume !(~q > ~p); 96770#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96825#$Ultimate##0 ~p := #in~p;~q := #in~q; 96989#L20 assume !(~p <= 0); 96982#L21 assume !(~q <= 0); 96983#L22 assume !(~q > ~p); 96995#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97000#$Ultimate##0 ~p := #in~p;~q := #in~q; 97036#L20 assume ~p <= 0;#res := 1; 97034#partsFINAL assume true; 96993#partsEXIT >#64#return; 96996#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97011#$Ultimate##0 ~p := #in~p;~q := #in~q; 97020#L20 assume !(~p <= 0); 97016#L21 assume ~q <= 0;#res := 0; 97012#partsFINAL assume true; 97009#partsEXIT >#66#return; 96974#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96975#partsFINAL assume true; 96932#partsEXIT >#64#return; 96914#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96916#$Ultimate##0 ~p := #in~p;~q := #in~q; 96924#L20 assume !(~p <= 0); 96922#L21 assume ~q <= 0;#res := 0; 96919#partsFINAL assume true; 96913#partsEXIT >#66#return; 96734#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96735#partsFINAL assume true; 96908#partsEXIT >#66#return; 96692#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96688#partsFINAL assume true; 96682#partsEXIT >#68#return; 96679#L36-1 havoc main_#t~ret8#1; 96680#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 96504#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 96369#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 96686#$Ultimate##0 ~p := #in~p;~q := #in~q; 96864#L20 assume !(~p <= 0); 96863#L21 assume !(~q <= 0); 96862#L22 assume ~q > ~p; 96465#L22-1 call #t~ret0 := parts(~p, ~p);< 96474#$Ultimate##0 ~p := #in~p;~q := #in~q; 96473#L20 assume !(~p <= 0); 96472#L21 assume !(~q <= 0); 96470#L22 assume !(~q > ~p); 96460#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96467#$Ultimate##0 ~p := #in~p;~q := #in~q; 96471#L20 assume ~p <= 0;#res := 1; 96469#partsFINAL assume true; 96459#partsEXIT >#64#return; 96452#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96455#$Ultimate##0 ~p := #in~p;~q := #in~q; 96454#L20 assume !(~p <= 0); 96451#L21 assume !(~q <= 0); 96453#L22 assume !(~q > ~p); 96328#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96879#$Ultimate##0 ~p := #in~p;~q := #in~q; 96442#L20 assume !(~p <= 0); 96443#L21 assume !(~q <= 0); 96673#L22 assume !(~q > ~p); 96301#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96329#$Ultimate##0 ~p := #in~p;~q := #in~q; 96377#L20 assume ~p <= 0;#res := 1; 96378#partsFINAL assume true; 96300#partsEXIT >#64#return; 96304#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96310#$Ultimate##0 ~p := #in~p;~q := #in~q; 96972#L20 assume !(~p <= 0); 96344#L21 assume ~q <= 0;#res := 0; 96345#partsFINAL assume true; 97061#partsEXIT >#66#return; 97060#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 97059#partsFINAL assume true; 96878#partsEXIT >#64#return; 96871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 96875#$Ultimate##0 ~p := #in~p;~q := #in~q; 96881#L20 assume !(~p <= 0); 96880#L21 assume ~q <= 0;#res := 0; 96876#partsFINAL assume true; 96870#partsEXIT >#66#return; 96869#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96868#partsFINAL assume true; 96867#partsEXIT >#66#return; 96861#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 96860#partsFINAL assume true; 96859#partsEXIT >#62#return; 96675#L22-2 #res := #t~ret0;havoc #t~ret0; 96676#partsFINAL assume true; 96507#partsEXIT >#68#return; 96371#L36-1 [2023-02-15 14:15:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 4 times [2023-02-15 14:15:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878458417] [2023-02-15 14:15:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash -917288381, now seen corresponding path program 3 times [2023-02-15 14:15:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138814474] [2023-02-15 14:15:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:19,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 8683649, now seen corresponding path program 5 times [2023-02-15 14:15:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:19,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520023518] [2023-02-15 14:15:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 14:15:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 14:15:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 14:15:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-02-15 14:15:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-02-15 14:15:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-02-15 14:15:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-02-15 14:15:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:19,399 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 14:15:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520023518] [2023-02-15 14:15:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520023518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727215164] [2023-02-15 14:15:19,400 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 14:15:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:19,401 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:19,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2023-02-15 14:15:19,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-15 14:15:19,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:19,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 14:15:19,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1070 proven. 148 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2023-02-15 14:15:19,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 76 proven. 224 refuted. 0 times theorem prover too weak. 2305 trivial. 0 not checked. [2023-02-15 14:15:19,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727215164] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:19,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:19,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 17 [2023-02-15 14:15:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227476534] [2023-02-15 14:15:19,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:21,266 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:21,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:21,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:21,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:21,266 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:21,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:21,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:21,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration20_Loop [2023-02-15 14:15:21,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:21,266 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:21,267 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 14:15:21,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 14:15:21,276 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 14:15:21,278 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 14:15:21,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:21,305 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,306 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 14:15:21,308 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 14:15:21,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:21,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,343 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 14:15:21,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,345 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 14:15:21,347 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 14:15:21,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:21,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:21,537 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:21,542 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 14:15:21,542 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:21,542 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:21,542 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:21,542 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:21,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:21,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:21,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:21,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration20_Loop [2023-02-15 14:15:21,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:21,542 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:21,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 14:15:21,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 14:15:21,552 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 14:15:21,554 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 14:15:21,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:21,581 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:21,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,582 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 14:15:21,583 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 14:15:21,586 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 14:15:21,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:21,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:21,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:21,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:21,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:21,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:21,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,598 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 14:15:21,600 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 14:15:21,601 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 14:15:21,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:21,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:21,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:21,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:21,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:21,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:21,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:21,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:21,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:21,625 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:21,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:21,627 INFO L229 MonitoredProcess]: Starting monitored process 137 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 14:15:21,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-02-15 14:15:21,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:21,629 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:21,629 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:21,630 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 14:15:21,633 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 14:15:21,633 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:21,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2023-02-15 14:15:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:21,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:21,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:22,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 14:15:22,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:22,443 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 14:15:22,443 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 14:15:22,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 762 states and 879 transitions. cyclomatic complexity: 131 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 14:15:22,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 762 states and 879 transitions. cyclomatic complexity: 131. 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 2059 states and 2444 transitions. Complement of second has 81 states. [2023-02-15 14:15:22,699 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 14:15:22,700 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 14:15:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2023-02-15 14:15:22,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 154 letters. [2023-02-15 14:15:22,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:22,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 245 letters. Loop has 154 letters. [2023-02-15 14:15:22,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:22,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 308 letters. [2023-02-15 14:15:22,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:22,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2059 states and 2444 transitions. [2023-02-15 14:15:22,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:22,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2059 states to 1978 states and 2358 transitions. [2023-02-15 14:15:22,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2023-02-15 14:15:22,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2023-02-15 14:15:22,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1978 states and 2358 transitions. [2023-02-15 14:15:22,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:22,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1978 states and 2358 transitions. [2023-02-15 14:15:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states and 2358 transitions. [2023-02-15 14:15:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1580. [2023-02-15 14:15:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1107 states have (on average 1.047877145438121) internal successors, (1160), 1140 states have internal predecessors, (1160), 271 states have call successors, (292), 200 states have call predecessors, (292), 202 states have return successors, (396), 239 states have call predecessors, (396), 271 states have call successors, (396) [2023-02-15 14:15:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1848 transitions. [2023-02-15 14:15:22,755 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1580 states and 1848 transitions. [2023-02-15 14:15:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 14:15:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-02-15 14:15:22,755 INFO L87 Difference]: Start difference. First operand 1580 states and 1848 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 11 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (20), 12 states have call predecessors, (20), 11 states have call successors, (20) [2023-02-15 14:15:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:22,967 INFO L93 Difference]: Finished difference Result 1828 states and 2173 transitions. [2023-02-15 14:15:22,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1828 states and 2173 transitions. [2023-02-15 14:15:22,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2023-02-15 14:15:22,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1828 states to 1656 states and 1970 transitions. [2023-02-15 14:15:22,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2023-02-15 14:15:22,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2023-02-15 14:15:22,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1656 states and 1970 transitions. [2023-02-15 14:15:22,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:22,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1656 states and 1970 transitions. [2023-02-15 14:15:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states and 1970 transitions. [2023-02-15 14:15:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1564. [2023-02-15 14:15:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1094 states have (on average 1.0484460694698354) internal successors, (1147), 1127 states have internal predecessors, (1147), 270 states have call successors, (289), 194 states have call predecessors, (289), 200 states have return successors, (393), 242 states have call predecessors, (393), 270 states have call successors, (393) [2023-02-15 14:15:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1829 transitions. [2023-02-15 14:15:23,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1564 states and 1829 transitions. [2023-02-15 14:15:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 14:15:23,006 INFO L428 stractBuchiCegarLoop]: Abstraction has 1564 states and 1829 transitions. [2023-02-15 14:15:23,006 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-02-15 14:15:23,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1564 states and 1829 transitions. [2023-02-15 14:15:23,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:23,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:23,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:23,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:23,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [25, 25, 20, 12, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1] [2023-02-15 14:15:23,010 INFO L748 eck$LassoCheckResult]: Stem: 105382#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 105342#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; 105343#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 105340#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; 105341#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 105401#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105611#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105612#$Ultimate##0 ~p := #in~p;~q := #in~q; 105614#L20 assume ~p <= 0;#res := 1; 105613#partsFINAL assume true; 105610#partsEXIT >#68#return; 105607#L36-1 havoc main_#t~ret8#1; 105608#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105732#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105729#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105730#$Ultimate##0 ~p := #in~p;~q := #in~q; 105733#L20 assume ~p <= 0;#res := 1; 105731#partsFINAL assume true; 105728#partsEXIT >#68#return; 105727#L36-1 havoc main_#t~ret8#1; 105726#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105724#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105722#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105690#$Ultimate##0 ~p := #in~p;~q := #in~q; 105725#L20 assume ~p <= 0;#res := 1; 105723#partsFINAL assume true; 105721#partsEXIT >#68#return; 105707#L36-1 havoc main_#t~ret8#1; 105704#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105701#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105689#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105691#$Ultimate##0 ~p := #in~p;~q := #in~q; 105693#L20 assume ~p <= 0;#res := 1; 105692#partsFINAL assume true; 105688#partsEXIT >#68#return; 105687#L36-1 havoc main_#t~ret8#1; 105670#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105669#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 105668#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 105665#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 105662#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105658#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105659#$Ultimate##0 ~p := #in~p;~q := #in~q; 105667#L20 assume !(~p <= 0); 105664#L21 assume ~q <= 0;#res := 0; 105661#partsFINAL assume true; 105657#partsEXIT >#68#return; 105653#L36-1 havoc main_#t~ret8#1; 105649#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105644#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105640#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105641#$Ultimate##0 ~p := #in~p;~q := #in~q; 105666#L20 assume !(~p <= 0); 105663#L21 assume !(~q <= 0); 105660#L22 assume !(~q > ~p); 105655#L23 call #t~ret1 := parts(~p - ~q, ~q);< 105656#$Ultimate##0 ~p := #in~p;~q := #in~q; 105682#L20 assume ~p <= 0;#res := 1; 105681#partsFINAL assume true; 105654#partsEXIT >#64#return; 105651#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 105652#$Ultimate##0 ~p := #in~p;~q := #in~q; 105680#L20 assume !(~p <= 0); 105679#L21 assume ~q <= 0;#res := 0; 105678#partsFINAL assume true; 105650#partsEXIT >#66#return; 105648#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 105643#partsFINAL assume true; 105639#partsEXIT >#68#return; 105634#L36-1 havoc main_#t~ret8#1; 105622#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105620#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105617#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105618#$Ultimate##0 ~p := #in~p;~q := #in~q; 105705#L20 assume !(~p <= 0); 105699#L21 assume !(~q <= 0); 105700#L22 assume ~q > ~p; 105629#L22-1 call #t~ret0 := parts(~p, ~p);< 105633#$Ultimate##0 ~p := #in~p;~q := #in~q; 105748#L20 assume !(~p <= 0); 105735#L21 assume !(~q <= 0); 105736#L22 assume !(~q > ~p); 105675#L23 call #t~ret1 := parts(~p - ~q, ~q);< 105676#$Ultimate##0 ~p := #in~p;~q := #in~q; 106315#L20 assume ~p <= 0;#res := 1; 106314#partsFINAL assume true; 105673#partsEXIT >#64#return; 105646#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 105647#$Ultimate##0 ~p := #in~p;~q := #in~q; 105677#L20 assume !(~p <= 0); 105672#L21 assume ~q <= 0;#res := 0; 105671#partsFINAL assume true; 105645#partsEXIT >#66#return; 105642#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 105636#partsFINAL assume true; 105623#partsEXIT >#62#return; 105621#L22-2 #res := #t~ret0;havoc #t~ret0; 105619#partsFINAL assume true; 105616#partsEXIT >#68#return; 105592#L36-1 havoc main_#t~ret8#1; 105520#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105514#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105360#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105508#$Ultimate##0 ~p := #in~p;~q := #in~q; 105537#L20 assume !(~p <= 0); 105532#L21 assume !(~q <= 0); 105359#L22 assume ~q > ~p; 105361#L22-1 call #t~ret0 := parts(~p, ~p);< 105523#$Ultimate##0 ~p := #in~p;~q := #in~q; 105435#L20 assume !(~p <= 0); 105438#L21 assume !(~q <= 0); 105543#L22 assume !(~q > ~p); 105535#L23 call #t~ret1 := parts(~p - ~q, ~q);< 105455#$Ultimate##0 ~p := #in~p;~q := #in~q; 105540#L20 assume ~p <= 0;#res := 1; 105539#partsFINAL assume true; 105534#partsEXIT >#64#return; 105529#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 105530#$Ultimate##0 ~p := #in~p;~q := #in~q; 105542#L20 assume !(~p <= 0); 105541#L21 assume ~q <= 0;#res := 0; 105533#partsFINAL assume true; 105528#partsEXIT >#66#return; 105525#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 105524#partsFINAL assume true; 105521#partsEXIT >#62#return; 105387#L22-2 #res := #t~ret0;havoc #t~ret0; 105388#partsFINAL assume true; 105503#partsEXIT >#68#return; 105409#L36-1 [2023-02-15 14:15:23,010 INFO L750 eck$LassoCheckResult]: Loop: 105409#L36-1 havoc main_#t~ret8#1; 105404#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105405#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 106010#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 106009#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 105355#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105356#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105425#$Ultimate##0 ~p := #in~p;~q := #in~q; 105424#L20 assume !(~p <= 0); 105423#L21 assume ~q <= 0;#res := 0; 105420#partsFINAL assume true; 105421#partsEXIT >#68#return; 105394#L36-1 havoc main_#t~ret8#1; 105395#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105976#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105344#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105345#$Ultimate##0 ~p := #in~p;~q := #in~q; 106163#L20 assume !(~p <= 0); 106161#L21 assume !(~q <= 0); 106160#L22 assume !(~q > ~p); 106158#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106159#$Ultimate##0 ~p := #in~p;~q := #in~q; 106227#L20 assume !(~p <= 0); 106225#L21 assume !(~q <= 0); 106222#L22 assume !(~q > ~p); 106171#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106173#$Ultimate##0 ~p := #in~p;~q := #in~q; 106181#L20 assume !(~p <= 0); 106180#L21 assume !(~q <= 0); 106178#L22 assume !(~q > ~p); 106179#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106224#$Ultimate##0 ~p := #in~p;~q := #in~q; 106228#L20 assume ~p <= 0;#res := 1; 106226#partsFINAL assume true; 106223#partsEXIT >#64#return; 106183#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106184#$Ultimate##0 ~p := #in~p;~q := #in~q; 106189#L20 assume !(~p <= 0); 106187#L21 assume ~q <= 0;#res := 0; 106185#partsFINAL assume true; 106182#partsEXIT >#66#return; 106168#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106176#partsFINAL assume true; 106170#partsEXIT >#64#return; 106167#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106169#$Ultimate##0 ~p := #in~p;~q := #in~q; 106190#L20 assume !(~p <= 0); 106188#L21 assume ~q <= 0;#res := 0; 106186#partsFINAL assume true; 106165#partsEXIT >#66#return; 106164#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106162#partsFINAL assume true; 106157#partsEXIT >#64#return; 106142#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106143#$Ultimate##0 ~p := #in~p;~q := #in~q; 106156#L20 assume !(~p <= 0); 106155#L21 assume ~q <= 0;#res := 0; 106154#partsFINAL assume true; 106141#partsEXIT >#66#return; 106138#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106135#partsFINAL assume true; 106130#partsEXIT >#68#return; 105932#L36-1 havoc main_#t~ret8#1; 105928#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105926#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105758#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105924#$Ultimate##0 ~p := #in~p;~q := #in~q; 106003#L20 assume !(~p <= 0); 106002#L21 assume !(~q <= 0); 105994#L22 assume !(~q > ~p); 105995#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106309#$Ultimate##0 ~p := #in~p;~q := #in~q; 106445#L20 assume ~p <= 0;#res := 1; 106444#partsFINAL assume true; 106307#partsEXIT >#64#return; 105988#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106305#$Ultimate##0 ~p := #in~p;~q := #in~q; 106261#L20 assume !(~p <= 0); 106257#L21 assume !(~q <= 0); 106258#L22 assume !(~q > ~p); 106032#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106035#$Ultimate##0 ~p := #in~p;~q := #in~q; 106054#L20 assume !(~p <= 0); 106050#L21 assume !(~q <= 0); 106048#L22 assume ~q > ~p; 106044#L22-1 call #t~ret0 := parts(~p, ~p);< 106045#$Ultimate##0 ~p := #in~p;~q := #in~q; 106065#L20 assume !(~p <= 0); 106064#L21 assume !(~q <= 0); 106061#L22 assume !(~q > ~p); 106057#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106058#$Ultimate##0 ~p := #in~p;~q := #in~q; 106063#L20 assume ~p <= 0;#res := 1; 106060#partsFINAL assume true; 106056#partsEXIT >#64#return; 106052#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106053#$Ultimate##0 ~p := #in~p;~q := #in~q; 106062#L20 assume !(~p <= 0); 106059#L21 assume ~q <= 0;#res := 0; 106055#partsFINAL assume true; 106051#partsEXIT >#66#return; 106049#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106047#partsFINAL assume true; 106043#partsEXIT >#62#return; 106041#L22-2 #res := #t~ret0;havoc #t~ret0; 106037#partsFINAL assume true; 106031#partsEXIT >#64#return; 105982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 105986#$Ultimate##0 ~p := #in~p;~q := #in~q; 106046#L20 assume !(~p <= 0); 106042#L21 assume !(~q <= 0); 106038#L22 assume !(~q > ~p); 106039#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106256#$Ultimate##0 ~p := #in~p;~q := #in~q; 106403#L20 assume !(~p <= 0); 106394#L21 assume !(~q <= 0); 106395#L22 assume ~q > ~p; 106369#L22-1 call #t~ret0 := parts(~p, ~p);< 106371#$Ultimate##0 ~p := #in~p;~q := #in~q; 106393#L20 assume !(~p <= 0); 106392#L21 assume !(~q <= 0); 106389#L22 assume !(~q > ~p); 106385#L23 call #t~ret1 := parts(~p - ~q, ~q);< 106386#$Ultimate##0 ~p := #in~p;~q := #in~q; 106391#L20 assume ~p <= 0;#res := 1; 106388#partsFINAL assume true; 106384#partsEXIT >#64#return; 106381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106382#$Ultimate##0 ~p := #in~p;~q := #in~q; 106390#L20 assume !(~p <= 0); 106387#L21 assume ~q <= 0;#res := 0; 106383#partsFINAL assume true; 106380#partsEXIT >#66#return; 106378#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106372#partsFINAL assume true; 106367#partsEXIT >#62#return; 106364#L22-2 #res := #t~ret0;havoc #t~ret0; 106366#partsFINAL assume true; 106735#partsEXIT >#64#return; 106028#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 106029#$Ultimate##0 ~p := #in~p;~q := #in~q; 106262#L20 assume !(~p <= 0); 106259#L21 assume ~q <= 0;#res := 0; 106248#partsFINAL assume true; 106251#partsEXIT >#66#return; 105984#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 105987#partsFINAL assume true; 105978#partsEXIT >#66#return; 105985#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106758#partsFINAL assume true; 106757#partsEXIT >#66#return; 106756#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 106755#partsFINAL assume true; 106753#partsEXIT >#68#return; 106751#L36-1 havoc main_#t~ret8#1; 105749#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 105502#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 105465#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 105492#$Ultimate##0 ~p := #in~p;~q := #in~q; 105491#L20 assume !(~p <= 0); 105490#L21 assume !(~q <= 0); 105489#L22 assume ~q > ~p; 105454#L22-1 call #t~ret0 := parts(~p, ~p);< 105463#$Ultimate##0 ~p := #in~p;~q := #in~q; 105462#L20 assume !(~p <= 0); 105461#L21 assume !(~q <= 0); 105459#L22 assume !(~q > ~p); 105449#L23 call #t~ret1 := parts(~p - ~q, ~q);< 105455#$Ultimate##0 ~p := #in~p;~q := #in~q; 105540#L20 assume ~p <= 0;#res := 1; 105539#partsFINAL assume true; 105534#partsEXIT >#64#return; 105529#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 105530#$Ultimate##0 ~p := #in~p;~q := #in~q; 105542#L20 assume !(~p <= 0); 105541#L21 assume ~q <= 0;#res := 0; 105533#partsFINAL assume true; 105528#partsEXIT >#66#return; 105525#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 105524#partsFINAL assume true; 105521#partsEXIT >#62#return; 105516#L22-2 #res := #t~ret0;havoc #t~ret0; 105517#partsFINAL assume true; 105504#partsEXIT >#68#return; 105409#L36-1 [2023-02-15 14:15:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 726159332, now seen corresponding path program 6 times [2023-02-15 14:15:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951017332] [2023-02-15 14:15:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:23,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 483514011, now seen corresponding path program 4 times [2023-02-15 14:15:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:23,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233157943] [2023-02-15 14:15:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-02-15 14:15:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-02-15 14:15:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 328 proven. 106 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2023-02-15 14:15:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233157943] [2023-02-15 14:15:23,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233157943] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613972103] [2023-02-15 14:15:23,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:23,315 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:23,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2023-02-15 14:15:23,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:23,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:23,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 14:15:23,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 557 proven. 324 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2023-02-15 14:15:23,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 122 proven. 422 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2023-02-15 14:15:24,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613972103] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:24,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 18] total 31 [2023-02-15 14:15:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006302360] [2023-02-15 14:15:24,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:24,247 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 14:15:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2023-02-15 14:15:24,248 INFO L87 Difference]: Start difference. First operand 1564 states and 1829 transitions. cyclomatic complexity: 292 Second operand has 31 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 30 states have internal predecessors, (91), 20 states have call successors, (28), 2 states have call predecessors, (28), 9 states have return successors, (32), 13 states have call predecessors, (32), 20 states have call successors, (32) [2023-02-15 14:15:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:25,255 INFO L93 Difference]: Finished difference Result 2080 states and 2419 transitions. [2023-02-15 14:15:25,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2080 states and 2419 transitions. [2023-02-15 14:15:25,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-15 14:15:25,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2080 states to 1451 states and 1652 transitions. [2023-02-15 14:15:25,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2023-02-15 14:15:25,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2023-02-15 14:15:25,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1451 states and 1652 transitions. [2023-02-15 14:15:25,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:25,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1451 states and 1652 transitions. [2023-02-15 14:15:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states and 1652 transitions. [2023-02-15 14:15:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1267. [2023-02-15 14:15:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 893 states have (on average 1.032474804031355) internal successors, (922), 916 states have internal predecessors, (922), 212 states have call successors, (230), 158 states have call predecessors, (230), 162 states have return successors, (278), 192 states have call predecessors, (278), 212 states have call successors, (278) [2023-02-15 14:15:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1430 transitions. [2023-02-15 14:15:25,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1267 states and 1430 transitions. [2023-02-15 14:15:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 14:15:25,322 INFO L428 stractBuchiCegarLoop]: Abstraction has 1267 states and 1430 transitions. [2023-02-15 14:15:25,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-02-15 14:15:25,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1267 states and 1430 transitions. [2023-02-15 14:15:25,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:25,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:25,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:25,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:25,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 29, 17, 14, 14, 14, 14, 14, 14, 12, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1] [2023-02-15 14:15:25,326 INFO L748 eck$LassoCheckResult]: Stem: 110718#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 110685#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; 110686#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 110679#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; 110680#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 110729#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110965#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110966#$Ultimate##0 ~p := #in~p;~q := #in~q; 110968#L20 assume ~p <= 0;#res := 1; 110967#partsFINAL assume true; 110964#partsEXIT >#68#return; 110962#L36-1 havoc main_#t~ret8#1; 110961#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110959#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110956#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110957#$Ultimate##0 ~p := #in~p;~q := #in~q; 110960#L20 assume ~p <= 0;#res := 1; 110958#partsFINAL assume true; 110955#partsEXIT >#68#return; 110954#L36-1 havoc main_#t~ret8#1; 110953#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110951#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110949#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110936#$Ultimate##0 ~p := #in~p;~q := #in~q; 110952#L20 assume ~p <= 0;#res := 1; 110950#partsFINAL assume true; 110948#partsEXIT >#68#return; 110945#L36-1 havoc main_#t~ret8#1; 110941#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110939#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110935#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110937#$Ultimate##0 ~p := #in~p;~q := #in~q; 110940#L20 assume ~p <= 0;#res := 1; 110938#partsFINAL assume true; 110934#partsEXIT >#68#return; 110933#L36-1 havoc main_#t~ret8#1; 110932#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110931#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 110929#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 110928#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 110926#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110905#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110906#$Ultimate##0 ~p := #in~p;~q := #in~q; 110922#L20 assume !(~p <= 0); 110920#L21 assume ~q <= 0;#res := 0; 110918#partsFINAL assume true; 110904#partsEXIT >#68#return; 110902#L36-1 havoc main_#t~ret8#1; 110895#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110892#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110888#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110889#$Ultimate##0 ~p := #in~p;~q := #in~q; 110923#L20 assume !(~p <= 0); 110921#L21 assume !(~q <= 0); 110919#L22 assume !(~q > ~p); 110916#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110917#$Ultimate##0 ~p := #in~p;~q := #in~q; 110927#L20 assume ~p <= 0;#res := 1; 110925#partsFINAL assume true; 110915#partsEXIT >#64#return; 110900#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110901#$Ultimate##0 ~p := #in~p;~q := #in~q; 110924#L20 assume !(~p <= 0); 110914#L21 assume ~q <= 0;#res := 0; 110913#partsFINAL assume true; 110899#partsEXIT >#66#return; 110894#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110891#partsFINAL assume true; 110887#partsEXIT >#68#return; 110885#L36-1 havoc main_#t~ret8#1; 110873#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110871#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110868#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110869#$Ultimate##0 ~p := #in~p;~q := #in~q; 110971#L20 assume !(~p <= 0); 110972#L21 assume !(~q <= 0); 110946#L22 assume ~q > ~p; 110880#L22-1 call #t~ret0 := parts(~p, ~p);< 111297#$Ultimate##0 ~p := #in~p;~q := #in~q; 111294#L20 assume !(~p <= 0); 111292#L21 assume !(~q <= 0); 111291#L22 assume !(~q > ~p); 110909#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111278#$Ultimate##0 ~p := #in~p;~q := #in~q; 111283#L20 assume ~p <= 0;#res := 1; 111282#partsFINAL assume true; 110908#partsEXIT >#64#return; 110897#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110898#$Ultimate##0 ~p := #in~p;~q := #in~q; 110930#L20 assume !(~p <= 0); 110907#L21 assume ~q <= 0;#res := 0; 110903#partsFINAL assume true; 110896#partsEXIT >#66#return; 110893#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110890#partsFINAL assume true; 110874#partsEXIT >#62#return; 110872#L22-2 #res := #t~ret0;havoc #t~ret0; 110870#partsFINAL assume true; 110867#partsEXIT >#68#return; 110866#L36-1 havoc main_#t~ret8#1; 110863#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110862#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110739#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110741#$Ultimate##0 ~p := #in~p;~q := #in~q; 110846#L20 assume !(~p <= 0); 110842#L21 assume !(~q <= 0); 110840#L22 assume ~q > ~p; 110760#L22-1 call #t~ret0 := parts(~p, ~p);< 110771#$Ultimate##0 ~p := #in~p;~q := #in~q; 110772#L20 assume !(~p <= 0); 110759#L21 assume !(~q <= 0); 110763#L22 assume !(~q > ~p); 110849#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110789#$Ultimate##0 ~p := #in~p;~q := #in~q; 110853#L20 assume ~p <= 0;#res := 1; 110851#partsFINAL assume true; 110848#partsEXIT >#64#return; 110844#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110845#$Ultimate##0 ~p := #in~p;~q := #in~q; 110852#L20 assume !(~p <= 0); 110850#L21 assume ~q <= 0;#res := 0; 110847#partsFINAL assume true; 110843#partsEXIT >#66#return; 110841#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110839#partsFINAL assume true; 110836#partsEXIT >#62#return; 110835#L22-2 #res := #t~ret0;havoc #t~ret0; 110834#partsFINAL assume true; 110738#partsEXIT >#68#return; 110734#L36-1 [2023-02-15 14:15:25,326 INFO L750 eck$LassoCheckResult]: Loop: 110734#L36-1 havoc main_#t~ret8#1; 110733#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110732#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 110692#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 110693#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 110743#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110736#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110737#$Ultimate##0 ~p := #in~p;~q := #in~q; 110745#L20 assume !(~p <= 0); 110744#L21 assume ~q <= 0;#res := 0; 110742#partsFINAL assume true; 110735#partsEXIT >#68#return; 110726#L36-1 havoc main_#t~ret8#1; 110723#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110696#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110681#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110682#$Ultimate##0 ~p := #in~p;~q := #in~q; 111224#L20 assume !(~p <= 0); 111223#L21 assume !(~q <= 0); 111222#L22 assume !(~q > ~p); 111182#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111183#$Ultimate##0 ~p := #in~p;~q := #in~q; 111249#L20 assume !(~p <= 0); 111248#L21 assume !(~q <= 0); 111247#L22 assume !(~q > ~p); 111243#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111246#$Ultimate##0 ~p := #in~p;~q := #in~q; 111267#L20 assume !(~p <= 0); 111266#L21 assume !(~q <= 0); 111264#L22 assume !(~q > ~p); 111265#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111418#$Ultimate##0 ~p := #in~p;~q := #in~q; 111422#L20 assume ~p <= 0;#res := 1; 111420#partsFINAL assume true; 111417#partsEXIT >#64#return; 111414#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111415#$Ultimate##0 ~p := #in~p;~q := #in~q; 111421#L20 assume !(~p <= 0); 111419#L21 assume ~q <= 0;#res := 0; 111416#partsFINAL assume true; 111413#partsEXIT >#66#return; 111239#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111409#partsFINAL assume true; 111245#partsEXIT >#64#return; 111238#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111240#$Ultimate##0 ~p := #in~p;~q := #in~q; 111268#L20 assume !(~p <= 0); 111263#L21 assume ~q <= 0;#res := 0; 111242#partsFINAL assume true; 111236#partsEXIT >#66#return; 111235#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111234#partsFINAL assume true; 111181#partsEXIT >#64#return; 111170#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111171#$Ultimate##0 ~p := #in~p;~q := #in~q; 111221#L20 assume !(~p <= 0); 111180#L21 assume ~q <= 0;#res := 0; 111176#partsFINAL assume true; 111169#partsEXIT >#66#return; 111166#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111163#partsFINAL assume true; 111158#partsEXIT >#68#return; 111155#L36-1 havoc main_#t~ret8#1; 111156#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 111288#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110988#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 111286#$Ultimate##0 ~p := #in~p;~q := #in~q; 111285#L20 assume !(~p <= 0); 111284#L21 assume !(~q <= 0); 111084#L22 assume !(~q > ~p); 111018#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111019#$Ultimate##0 ~p := #in~p;~q := #in~q; 111060#L20 assume !(~p <= 0); 111055#L21 assume !(~q <= 0); 111053#L22 assume ~q > ~p; 111050#L22-1 call #t~ret0 := parts(~p, ~p);< 111051#$Ultimate##0 ~p := #in~p;~q := #in~q; 111080#L20 assume !(~p <= 0); 111079#L21 assume !(~q <= 0); 111076#L22 assume !(~q > ~p); 111071#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111072#$Ultimate##0 ~p := #in~p;~q := #in~q; 111078#L20 assume ~p <= 0;#res := 1; 111075#partsFINAL assume true; 111070#partsEXIT >#64#return; 111066#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111067#$Ultimate##0 ~p := #in~p;~q := #in~q; 111077#L20 assume !(~p <= 0); 111074#L21 assume ~q <= 0;#res := 0; 111069#partsFINAL assume true; 111065#partsEXIT >#66#return; 111063#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111062#partsFINAL assume true; 111049#partsEXIT >#62#return; 111044#L22-2 #res := #t~ret0;havoc #t~ret0; 111041#partsFINAL assume true; 111017#partsEXIT >#64#return; 111004#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111008#$Ultimate##0 ~p := #in~p;~q := #in~q; 111114#L20 assume !(~p <= 0); 111110#L21 assume !(~q <= 0); 111108#L22 assume !(~q > ~p); 111095#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111098#$Ultimate##0 ~p := #in~p;~q := #in~q; 111122#L20 assume !(~p <= 0); 111118#L21 assume !(~q <= 0); 111116#L22 assume ~q > ~p; 111112#L22-1 call #t~ret0 := parts(~p, ~p);< 111113#$Ultimate##0 ~p := #in~p;~q := #in~q; 111133#L20 assume !(~p <= 0); 111132#L21 assume !(~q <= 0); 111129#L22 assume !(~q > ~p); 111125#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111126#$Ultimate##0 ~p := #in~p;~q := #in~q; 111131#L20 assume ~p <= 0;#res := 1; 111128#partsFINAL assume true; 111124#partsEXIT >#64#return; 111120#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111121#$Ultimate##0 ~p := #in~p;~q := #in~q; 111130#L20 assume !(~p <= 0); 111127#L21 assume ~q <= 0;#res := 0; 111123#partsFINAL assume true; 111119#partsEXIT >#66#return; 111117#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111115#partsFINAL assume true; 111111#partsEXIT >#62#return; 111109#L22-2 #res := #t~ret0;havoc #t~ret0; 111105#partsFINAL assume true; 111094#partsEXIT >#64#return; 111002#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111008#$Ultimate##0 ~p := #in~p;~q := #in~q; 111114#L20 assume !(~p <= 0); 111110#L21 assume !(~q <= 0); 111108#L22 assume !(~q > ~p); 111102#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111103#$Ultimate##0 ~p := #in~p;~q := #in~q; 111152#L20 assume !(~p <= 0); 111150#L21 assume !(~q <= 0); 111149#L22 assume !(~q > ~p); 111146#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111148#$Ultimate##0 ~p := #in~p;~q := #in~q; 111232#L20 assume !(~p <= 0); 111230#L21 assume !(~q <= 0); 111231#L22 assume !(~q > ~p); 111363#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111364#$Ultimate##0 ~p := #in~p;~q := #in~q; 111382#L20 assume ~p <= 0;#res := 1; 111381#partsFINAL assume true; 111361#partsEXIT >#64#return; 111359#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111360#$Ultimate##0 ~p := #in~p;~q := #in~q; 111380#L20 assume !(~p <= 0); 111379#L21 assume ~q <= 0;#res := 0; 111377#partsFINAL assume true; 111357#partsEXIT >#66#return; 111141#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111410#partsFINAL assume true; 111145#partsEXIT >#64#return; 111139#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111142#$Ultimate##0 ~p := #in~p;~q := #in~q; 111233#L20 assume !(~p <= 0); 111157#L21 assume ~q <= 0;#res := 0; 111154#partsFINAL assume true; 111138#partsEXIT >#66#return; 111136#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111134#partsFINAL assume true; 111099#partsEXIT >#64#return; 111091#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111092#$Ultimate##0 ~p := #in~p;~q := #in~q; 111107#L20 assume !(~p <= 0); 111104#L21 assume ~q <= 0;#res := 0; 111093#partsFINAL assume true; 111088#partsEXIT >#66#return; 111006#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111081#partsFINAL assume true; 111000#partsEXIT >#66#return; 111006#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111081#partsFINAL assume true; 111000#partsEXIT >#66#return; 110997#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110994#partsFINAL assume true; 110987#partsEXIT >#68#return; 110985#L36-1 havoc main_#t~ret8#1; 110986#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110982#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110976#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110992#$Ultimate##0 ~p := #in~p;~q := #in~q; 111153#L20 assume !(~p <= 0); 111086#L21 assume !(~q <= 0); 111087#L22 assume !(~q > ~p); 111272#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111274#$Ultimate##0 ~p := #in~p;~q := #in~q; 111280#L20 assume ~p <= 0;#res := 1; 111276#partsFINAL assume true; 111271#partsEXIT >#64#return; 111106#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111339#$Ultimate##0 ~p := #in~p;~q := #in~q; 111368#L20 assume !(~p <= 0); 111137#L21 assume !(~q <= 0); 111135#L22 assume !(~q > ~p); 111101#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111103#$Ultimate##0 ~p := #in~p;~q := #in~q; 111152#L20 assume !(~p <= 0); 111150#L21 assume !(~q <= 0); 111151#L22 assume !(~q > ~p); 111362#L23 call #t~ret1 := parts(~p - ~q, ~q);< 111364#$Ultimate##0 ~p := #in~p;~q := #in~q; 111382#L20 assume ~p <= 0;#res := 1; 111381#partsFINAL assume true; 111361#partsEXIT >#64#return; 111358#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111360#$Ultimate##0 ~p := #in~p;~q := #in~q; 111380#L20 assume !(~p <= 0); 111379#L21 assume ~q <= 0;#res := 0; 111377#partsFINAL assume true; 111357#partsEXIT >#66#return; 111355#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111354#partsFINAL assume true; 111350#partsEXIT >#64#return; 111345#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 111347#$Ultimate##0 ~p := #in~p;~q := #in~q; 111365#L20 assume !(~p <= 0); 111352#L21 assume ~q <= 0;#res := 0; 111348#partsFINAL assume true; 111343#partsEXIT >#66#return; 111342#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111341#partsFINAL assume true; 111338#partsEXIT >#66#return; 111336#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 111334#partsFINAL assume true; 111331#partsEXIT >#68#return; 111329#L36-1 havoc main_#t~ret8#1; 111315#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 110860#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 110700#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 110826#$Ultimate##0 ~p := #in~p;~q := #in~q; 110825#L20 assume !(~p <= 0); 110824#L21 assume !(~q <= 0); 110699#L22 assume ~q > ~p; 110701#L22-1 call #t~ret0 := parts(~p, ~p);< 110710#$Ultimate##0 ~p := #in~p;~q := #in~q; 110766#L20 assume !(~p <= 0); 110768#L21 assume !(~q <= 0); 110794#L22 assume !(~q > ~p); 110785#L23 call #t~ret1 := parts(~p - ~q, ~q);< 110789#$Ultimate##0 ~p := #in~p;~q := #in~q; 110853#L20 assume ~p <= 0;#res := 1; 110851#partsFINAL assume true; 110848#partsEXIT >#64#return; 110844#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 110845#$Ultimate##0 ~p := #in~p;~q := #in~q; 110852#L20 assume !(~p <= 0); 110850#L21 assume ~q <= 0;#res := 0; 110847#partsFINAL assume true; 110843#partsEXIT >#66#return; 110841#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 110839#partsFINAL assume true; 110836#partsEXIT >#62#return; 110837#L22-2 #res := #t~ret0;havoc #t~ret0; 110857#partsFINAL assume true; 110831#partsEXIT >#68#return; 110734#L36-1 [2023-02-15 14:15:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 726159332, now seen corresponding path program 7 times [2023-02-15 14:15:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:25,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109976374] [2023-02-15 14:15:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:25,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:25,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1423673064, now seen corresponding path program 5 times [2023-02-15 14:15:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:25,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327212117] [2023-02-15 14:15:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-02-15 14:15:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-02-15 14:15:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-02-15 14:15:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 266 proven. 278 refuted. 0 times theorem prover too weak. 2842 trivial. 0 not checked. [2023-02-15 14:15:25,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:25,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327212117] [2023-02-15 14:15:25,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327212117] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:25,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441318151] [2023-02-15 14:15:25,703 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 14:15:25,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:25,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:25,719 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:25,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2023-02-15 14:15:25,787 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-15 14:15:25,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:25,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 14:15:25,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1824 proven. 285 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2023-02-15 14:15:25,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 396 proven. 630 refuted. 0 times theorem prover too weak. 2360 trivial. 0 not checked. [2023-02-15 14:15:26,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441318151] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:26,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:26,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 27 [2023-02-15 14:15:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007948277] [2023-02-15 14:15:26,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:26,501 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 14:15:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2023-02-15 14:15:26,502 INFO L87 Difference]: Start difference. First operand 1267 states and 1430 transitions. cyclomatic complexity: 183 Second operand has 27 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 18 states have call successors, (30), 2 states have call predecessors, (30), 10 states have return successors, (33), 15 states have call predecessors, (33), 18 states have call successors, (33) [2023-02-15 14:15:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:27,066 INFO L93 Difference]: Finished difference Result 1357 states and 1526 transitions. [2023-02-15 14:15:27,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1357 states and 1526 transitions. [2023-02-15 14:15:27,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-15 14:15:27,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1357 states to 1337 states and 1498 transitions. [2023-02-15 14:15:27,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2023-02-15 14:15:27,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2023-02-15 14:15:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1337 states and 1498 transitions. [2023-02-15 14:15:27,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:27,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1337 states and 1498 transitions. [2023-02-15 14:15:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states and 1498 transitions. [2023-02-15 14:15:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1259. [2023-02-15 14:15:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 893 states have (on average 1.0279955207166853) internal successors, (918), 912 states have internal predecessors, (918), 204 states have call successors, (222), 158 states have call predecessors, (222), 162 states have return successors, (270), 188 states have call predecessors, (270), 204 states have call successors, (270) [2023-02-15 14:15:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1410 transitions. [2023-02-15 14:15:27,086 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1259 states and 1410 transitions. [2023-02-15 14:15:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 14:15:27,087 INFO L428 stractBuchiCegarLoop]: Abstraction has 1259 states and 1410 transitions. [2023-02-15 14:15:27,087 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-02-15 14:15:27,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1410 transitions. [2023-02-15 14:15:27,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:27,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:27,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:27,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:27,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 29, 17, 14, 14, 14, 14, 14, 14, 12, 7, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1] [2023-02-15 14:15:27,093 INFO L748 eck$LassoCheckResult]: Stem: 115693#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 115658#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; 115659#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 115652#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; 115653#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 115708#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115948#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115949#$Ultimate##0 ~p := #in~p;~q := #in~q; 115951#L20 assume ~p <= 0;#res := 1; 115950#partsFINAL assume true; 115947#partsEXIT >#68#return; 115945#L36-1 havoc main_#t~ret8#1; 115944#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115942#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115939#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115940#$Ultimate##0 ~p := #in~p;~q := #in~q; 115943#L20 assume ~p <= 0;#res := 1; 115941#partsFINAL assume true; 115938#partsEXIT >#68#return; 115937#L36-1 havoc main_#t~ret8#1; 115936#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115934#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115932#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115920#$Ultimate##0 ~p := #in~p;~q := #in~q; 115935#L20 assume ~p <= 0;#res := 1; 115933#partsFINAL assume true; 115931#partsEXIT >#68#return; 115928#L36-1 havoc main_#t~ret8#1; 115924#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115922#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115918#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115919#$Ultimate##0 ~p := #in~p;~q := #in~q; 115923#L20 assume ~p <= 0;#res := 1; 115921#partsFINAL assume true; 115917#partsEXIT >#68#return; 115916#L36-1 havoc main_#t~ret8#1; 115915#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115914#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 115913#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115912#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 115910#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115899#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115900#$Ultimate##0 ~p := #in~p;~q := #in~q; 115911#L20 assume !(~p <= 0); 115909#L21 assume ~q <= 0;#res := 0; 115906#partsFINAL assume true; 115898#partsEXIT >#68#return; 115891#L36-1 havoc main_#t~ret8#1; 115881#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115876#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115872#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115873#$Ultimate##0 ~p := #in~p;~q := #in~q; 115908#L20 assume !(~p <= 0); 115907#L21 assume !(~q <= 0); 115904#L22 assume !(~q > ~p); 115895#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115896#$Ultimate##0 ~p := #in~p;~q := #in~q; 115902#L20 assume ~p <= 0;#res := 1; 115901#partsFINAL assume true; 115894#partsEXIT >#64#return; 115889#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115890#$Ultimate##0 ~p := #in~p;~q := #in~q; 115905#L20 assume !(~p <= 0); 115897#L21 assume ~q <= 0;#res := 0; 115893#partsFINAL assume true; 115888#partsEXIT >#66#return; 115880#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115875#partsFINAL assume true; 115871#partsEXIT >#68#return; 115868#L36-1 havoc main_#t~ret8#1; 115856#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115854#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115851#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115852#$Ultimate##0 ~p := #in~p;~q := #in~q; 115956#L20 assume !(~p <= 0); 115957#L21 assume !(~q <= 0); 115952#L22 assume ~q > ~p; 115864#L22-1 call #t~ret0 := parts(~p, ~p);< 116202#$Ultimate##0 ~p := #in~p;~q := #in~q; 116200#L20 assume !(~p <= 0); 116198#L21 assume !(~q <= 0); 116197#L22 assume !(~q > ~p); 115886#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115887#$Ultimate##0 ~p := #in~p;~q := #in~q; 115953#L20 assume ~p <= 0;#res := 1; 115925#partsFINAL assume true; 115927#partsEXIT >#64#return; 115878#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115879#$Ultimate##0 ~p := #in~p;~q := #in~q; 115903#L20 assume !(~p <= 0); 115892#L21 assume ~q <= 0;#res := 0; 115882#partsFINAL assume true; 115877#partsEXIT >#66#return; 115874#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115870#partsFINAL assume true; 115857#partsEXIT >#62#return; 115855#L22-2 #res := #t~ret0;havoc #t~ret0; 115853#partsFINAL assume true; 115850#partsEXIT >#68#return; 115847#L36-1 havoc main_#t~ret8#1; 115842#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115840#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115671#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115718#$Ultimate##0 ~p := #in~p;~q := #in~q; 115841#L20 assume !(~p <= 0); 115839#L21 assume !(~q <= 0); 115670#L22 assume ~q > ~p; 115672#L22-1 call #t~ret0 := parts(~p, ~p);< 115683#$Ultimate##0 ~p := #in~p;~q := #in~q; 115746#L20 assume !(~p <= 0); 115736#L21 assume !(~q <= 0); 115739#L22 assume !(~q > ~p); 115829#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115760#$Ultimate##0 ~p := #in~p;~q := #in~q; 115833#L20 assume ~p <= 0;#res := 1; 115831#partsFINAL assume true; 115828#partsEXIT >#64#return; 115825#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115826#$Ultimate##0 ~p := #in~p;~q := #in~q; 115832#L20 assume !(~p <= 0); 115830#L21 assume ~q <= 0;#res := 0; 115827#partsFINAL assume true; 115824#partsEXIT >#66#return; 115823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115822#partsFINAL assume true; 115820#partsEXIT >#62#return; 115697#L22-2 #res := #t~ret0;havoc #t~ret0; 115698#partsFINAL assume true; 115716#partsEXIT >#68#return; 115712#L36-1 [2023-02-15 14:15:27,093 INFO L750 eck$LassoCheckResult]: Loop: 115712#L36-1 havoc main_#t~ret8#1; 115711#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115710#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 115663#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 115664#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 115720#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115714#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115715#$Ultimate##0 ~p := #in~p;~q := #in~q; 115722#L20 assume !(~p <= 0); 115721#L21 assume ~q <= 0;#res := 0; 115719#partsFINAL assume true; 115713#partsEXIT >#68#return; 115704#L36-1 havoc main_#t~ret8#1; 115694#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115667#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115654#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115655#$Ultimate##0 ~p := #in~p;~q := #in~q; 116276#L20 assume !(~p <= 0); 116272#L21 assume !(~q <= 0); 116269#L22 assume !(~q > ~p); 116263#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116264#$Ultimate##0 ~p := #in~p;~q := #in~q; 116311#L20 assume !(~p <= 0); 116309#L21 assume !(~q <= 0); 116307#L22 assume !(~q > ~p); 116297#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116305#$Ultimate##0 ~p := #in~p;~q := #in~q; 116320#L20 assume !(~p <= 0); 116318#L21 assume !(~q <= 0); 116316#L22 assume !(~q > ~p); 116317#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116342#$Ultimate##0 ~p := #in~p;~q := #in~q; 116346#L20 assume ~p <= 0;#res := 1; 116344#partsFINAL assume true; 116341#partsEXIT >#64#return; 116338#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116339#$Ultimate##0 ~p := #in~p;~q := #in~q; 116345#L20 assume !(~p <= 0); 116343#L21 assume ~q <= 0;#res := 0; 116340#partsFINAL assume true; 116337#partsEXIT >#66#return; 116285#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116333#partsFINAL assume true; 116304#partsEXIT >#64#return; 116284#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116286#$Ultimate##0 ~p := #in~p;~q := #in~q; 116315#L20 assume !(~p <= 0); 116303#L21 assume ~q <= 0;#res := 0; 116295#partsFINAL assume true; 116282#partsEXIT >#66#return; 116274#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116268#partsFINAL assume true; 116262#partsEXIT >#64#return; 116257#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116258#$Ultimate##0 ~p := #in~p;~q := #in~q; 116329#L20 assume !(~p <= 0); 116328#L21 assume ~q <= 0;#res := 0; 116327#partsFINAL assume true; 116256#partsEXIT >#66#return; 116253#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116250#partsFINAL assume true; 116245#partsEXIT >#68#return; 116246#L36-1 havoc main_#t~ret8#1; 116236#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 116237#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 116033#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 116037#$Ultimate##0 ~p := #in~p;~q := #in~q; 116167#L20 assume !(~p <= 0); 116168#L21 assume !(~q <= 0); 116123#L22 assume !(~q > ~p); 116108#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116109#$Ultimate##0 ~p := #in~p;~q := #in~q; 116128#L20 assume !(~p <= 0); 116122#L21 assume !(~q <= 0); 116121#L22 assume ~q > ~p; 116119#L22-1 call #t~ret0 := parts(~p, ~p);< 116120#$Ultimate##0 ~p := #in~p;~q := #in~q; 116147#L20 assume !(~p <= 0); 116145#L21 assume !(~q <= 0); 116144#L22 assume !(~q > ~p); 116142#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116143#$Ultimate##0 ~p := #in~p;~q := #in~q; 116148#L20 assume ~p <= 0;#res := 1; 116146#partsFINAL assume true; 116141#partsEXIT >#64#return; 116139#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116140#$Ultimate##0 ~p := #in~p;~q := #in~q; 116157#L20 assume !(~p <= 0); 116154#L21 assume ~q <= 0;#res := 0; 116150#partsFINAL assume true; 116138#partsEXIT >#66#return; 116137#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116127#partsFINAL assume true; 116118#partsEXIT >#62#return; 116117#L22-2 #res := #t~ret0;havoc #t~ret0; 116116#partsFINAL assume true; 116107#partsEXIT >#64#return; 116064#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116067#$Ultimate##0 ~p := #in~p;~q := #in~q; 116155#L20 assume !(~p <= 0); 116151#L21 assume !(~q <= 0); 116091#L22 assume !(~q > ~p); 116086#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116087#$Ultimate##0 ~p := #in~p;~q := #in~q; 116136#L20 assume !(~p <= 0); 116134#L21 assume !(~q <= 0); 116132#L22 assume !(~q > ~p); 116126#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116130#$Ultimate##0 ~p := #in~p;~q := #in~q; 116156#L20 assume !(~p <= 0); 116152#L21 assume !(~q <= 0); 116153#L22 assume !(~q > ~p); 116178#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116179#$Ultimate##0 ~p := #in~p;~q := #in~q; 116183#L20 assume ~p <= 0;#res := 1; 116182#partsFINAL assume true; 116176#partsEXIT >#64#return; 116170#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116173#$Ultimate##0 ~p := #in~p;~q := #in~q; 116181#L20 assume !(~p <= 0); 116180#L21 assume ~q <= 0;#res := 0; 116174#partsFINAL assume true; 116169#partsEXIT >#66#return; 116113#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116164#partsFINAL assume true; 116129#partsEXIT >#64#return; 116111#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116114#$Ultimate##0 ~p := #in~p;~q := #in~q; 116133#L20 assume !(~p <= 0); 116131#L21 assume ~q <= 0;#res := 0; 116124#partsFINAL assume true; 116110#partsEXIT >#66#return; 116105#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116102#partsFINAL assume true; 116083#partsEXIT >#64#return; 116080#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116081#$Ultimate##0 ~p := #in~p;~q := #in~q; 116115#L20 assume !(~p <= 0); 116106#L21 assume ~q <= 0;#res := 0; 116104#partsFINAL assume true; 116077#partsEXIT >#66#return; 116075#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116072#partsFINAL assume true; 116061#partsEXIT >#66#return; 116060#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116040#partsFINAL assume true; 116032#partsEXIT >#68#return; 116030#L36-1 havoc main_#t~ret8#1; 116031#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 116027#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 116021#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 116038#$Ultimate##0 ~p := #in~p;~q := #in~q; 116334#L20 assume !(~p <= 0); 116165#L21 assume !(~q <= 0); 116166#L22 assume ~q > ~p; 115862#L22-1 call #t~ret0 := parts(~p, ~p);< 116362#$Ultimate##0 ~p := #in~p;~q := #in~q; 116361#L20 assume !(~p <= 0); 116242#L21 assume !(~q <= 0); 116238#L22 assume !(~q > ~p); 115885#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116354#$Ultimate##0 ~p := #in~p;~q := #in~q; 116357#L20 assume ~p <= 0;#res := 1; 116356#partsFINAL assume true; 116351#partsEXIT >#64#return; 116073#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116398#$Ultimate##0 ~p := #in~p;~q := #in~q; 116347#L20 assume !(~p <= 0); 116348#L21 assume !(~q <= 0); 116239#L22 assume !(~q > ~p); 116084#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116087#$Ultimate##0 ~p := #in~p;~q := #in~q; 116136#L20 assume !(~p <= 0); 116134#L21 assume !(~q <= 0); 116135#L22 assume !(~q > ~p); 116177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 116179#$Ultimate##0 ~p := #in~p;~q := #in~q; 116183#L20 assume ~p <= 0;#res := 1; 116182#partsFINAL assume true; 116176#partsEXIT >#64#return; 116171#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116173#$Ultimate##0 ~p := #in~p;~q := #in~q; 116181#L20 assume !(~p <= 0); 116180#L21 assume ~q <= 0;#res := 0; 116174#partsFINAL assume true; 116169#partsEXIT >#66#return; 116172#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116409#partsFINAL assume true; 116407#partsEXIT >#64#return; 116402#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 116405#$Ultimate##0 ~p := #in~p;~q := #in~q; 116410#L20 assume !(~p <= 0); 116408#L21 assume ~q <= 0;#res := 0; 116406#partsFINAL assume true; 116401#partsEXIT >#66#return; 116400#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116399#partsFINAL assume true; 116397#partsEXIT >#66#return; 116396#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 116395#partsFINAL assume true; 116392#partsEXIT >#62#return; 116393#L22-2 #res := #t~ret0;havoc #t~ret0; 116414#partsFINAL assume true; 116411#partsEXIT >#68#return; 116385#L36-1 havoc main_#t~ret8#1; 115814#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115815#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 115796#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 115804#$Ultimate##0 ~p := #in~p;~q := #in~q; 115799#L20 assume !(~p <= 0); 115800#L21 assume !(~q <= 0); 115795#L22 assume ~q > ~p; 115743#L22-1 call #t~ret0 := parts(~p, ~p);< 115773#$Ultimate##0 ~p := #in~p;~q := #in~q; 115741#L20 assume !(~p <= 0); 115744#L21 assume !(~q <= 0); 115765#L22 assume !(~q > ~p); 115757#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115761#$Ultimate##0 ~p := #in~p;~q := #in~q; 115767#L20 assume ~p <= 0;#res := 1; 115763#partsFINAL assume true; 115756#partsEXIT >#64#return; 115754#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115753#$Ultimate##0 ~p := #in~p;~q := #in~q; 115755#L20 assume !(~p <= 0); 115769#L21 assume !(~q <= 0); 115766#L22 assume !(~q > ~p); 115748#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115976#$Ultimate##0 ~p := #in~p;~q := #in~q; 115998#L20 assume !(~p <= 0); 115996#L21 assume !(~q <= 0); 115997#L22 assume !(~q > ~p); 115638#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115660#$Ultimate##0 ~p := #in~p;~q := #in~q; 115707#L20 assume ~p <= 0;#res := 1; 115702#partsFINAL assume true; 115637#partsEXIT >#64#return; 115641#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115647#$Ultimate##0 ~p := #in~p;~q := #in~q; 115999#L20 assume !(~p <= 0); 115674#L21 assume ~q <= 0;#res := 0; 115675#partsFINAL assume true; 115992#partsEXIT >#66#return; 115989#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115983#partsFINAL assume true; 115979#partsEXIT >#64#return; 115964#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115973#$Ultimate##0 ~p := #in~p;~q := #in~q; 115978#L20 assume !(~p <= 0); 115977#L21 assume ~q <= 0;#res := 0; 115972#partsFINAL assume true; 115963#partsEXIT >#66#return; 115962#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115961#partsFINAL assume true; 115960#partsEXIT >#66#return; 115959#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 115848#partsFINAL assume true; 115843#partsEXIT >#62#return; 115835#L22-2 #res := #t~ret0;havoc #t~ret0; 115836#partsFINAL assume true; 116379#partsEXIT >#68#return; 115712#L36-1 [2023-02-15 14:15:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 726159332, now seen corresponding path program 8 times [2023-02-15 14:15:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653073633] [2023-02-15 14:15:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:27,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:27,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 938104304, now seen corresponding path program 6 times [2023-02-15 14:15:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155567602] [2023-02-15 14:15:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-02-15 14:15:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-02-15 14:15:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-02-15 14:15:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 163 proven. 554 refuted. 0 times theorem prover too weak. 2669 trivial. 0 not checked. [2023-02-15 14:15:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155567602] [2023-02-15 14:15:27,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155567602] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052793106] [2023-02-15 14:15:27,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 14:15:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:27,509 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:27,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2023-02-15 14:15:27,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-15 14:15:27,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:27,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 14:15:27,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1455 proven. 253 refuted. 0 times theorem prover too weak. 1678 trivial. 0 not checked. [2023-02-15 14:15:27,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 264 proven. 413 refuted. 0 times theorem prover too weak. 2709 trivial. 0 not checked. [2023-02-15 14:15:28,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052793106] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:28,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:28,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 28 [2023-02-15 14:15:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851026156] [2023-02-15 14:15:28,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:28,163 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 14:15:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-15 14:15:28,163 INFO L87 Difference]: Start difference. First operand 1259 states and 1410 transitions. cyclomatic complexity: 167 Second operand has 28 states, 25 states have (on average 3.8) internal successors, (95), 26 states have internal predecessors, (95), 18 states have call successors, (27), 2 states have call predecessors, (27), 8 states have return successors, (29), 14 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-15 14:15:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:28,800 INFO L93 Difference]: Finished difference Result 1323 states and 1466 transitions. [2023-02-15 14:15:28,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1323 states and 1466 transitions. [2023-02-15 14:15:28,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-15 14:15:28,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1323 states to 1187 states and 1318 transitions. [2023-02-15 14:15:28,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2023-02-15 14:15:28,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2023-02-15 14:15:28,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1187 states and 1318 transitions. [2023-02-15 14:15:28,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:28,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1187 states and 1318 transitions. [2023-02-15 14:15:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states and 1318 transitions. [2023-02-15 14:15:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1037. [2023-02-15 14:15:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 727 states have (on average 1.031636863823934) internal successors, (750), 746 states have internal predecessors, (750), 173 states have call successors, (184), 131 states have call predecessors, (184), 137 states have return successors, (208), 159 states have call predecessors, (208), 173 states have call successors, (208) [2023-02-15 14:15:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1142 transitions. [2023-02-15 14:15:28,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1037 states and 1142 transitions. [2023-02-15 14:15:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 14:15:28,821 INFO L428 stractBuchiCegarLoop]: Abstraction has 1037 states and 1142 transitions. [2023-02-15 14:15:28,821 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-02-15 14:15:28,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1037 states and 1142 transitions. [2023-02-15 14:15:28,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-15 14:15:28,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:28,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:28,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:28,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 34, 20, 17, 17, 17, 17, 17, 17, 14, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1] [2023-02-15 14:15:28,825 INFO L748 eck$LassoCheckResult]: Stem: 120609#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 120569#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; 120570#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 120567#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; 120568#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 120621#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120941#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120942#$Ultimate##0 ~p := #in~p;~q := #in~q; 120947#L20 assume ~p <= 0;#res := 1; 120943#partsFINAL assume true; 120940#partsEXIT >#68#return; 120938#L36-1 havoc main_#t~ret8#1; 120936#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120935#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120933#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120934#$Ultimate##0 ~p := #in~p;~q := #in~q; 120939#L20 assume ~p <= 0;#res := 1; 120937#partsFINAL assume true; 120932#partsEXIT >#68#return; 120931#L36-1 havoc main_#t~ret8#1; 120929#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120922#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120894#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120644#$Ultimate##0 ~p := #in~p;~q := #in~q; 120915#L20 assume ~p <= 0;#res := 1; 120914#partsFINAL assume true; 120893#partsEXIT >#68#return; 120892#L36-1 havoc main_#t~ret8#1; 120890#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120864#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120594#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120593#$Ultimate##0 ~p := #in~p;~q := #in~q; 120595#L20 assume ~p <= 0;#res := 1; 120863#partsFINAL assume true; 120642#partsEXIT >#68#return; 120643#L36-1 havoc main_#t~ret8#1; 120852#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120851#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 120582#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 120583#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 120835#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120832#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120833#$Ultimate##0 ~p := #in~p;~q := #in~q; 120848#L20 assume !(~p <= 0); 120846#L21 assume ~q <= 0;#res := 0; 120845#partsFINAL assume true; 120831#partsEXIT >#68#return; 120829#L36-1 havoc main_#t~ret8#1; 120828#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120827#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120825#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120826#$Ultimate##0 ~p := #in~p;~q := #in~q; 120844#L20 assume !(~p <= 0); 120843#L21 assume !(~q <= 0); 120842#L22 assume !(~q > ~p); 120840#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120841#$Ultimate##0 ~p := #in~p;~q := #in~q; 120853#L20 assume ~p <= 0;#res := 1; 120849#partsFINAL assume true; 120839#partsEXIT >#64#return; 120837#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120838#$Ultimate##0 ~p := #in~p;~q := #in~q; 120854#L20 assume !(~p <= 0); 120850#L21 assume ~q <= 0;#res := 0; 120847#partsFINAL assume true; 120836#partsEXIT >#66#return; 120834#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120830#partsFINAL assume true; 120824#partsEXIT >#68#return; 120821#L36-1 havoc main_#t~ret8#1; 120820#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120819#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120734#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120818#$Ultimate##0 ~p := #in~p;~q := #in~q; 120740#L20 assume !(~p <= 0); 120741#L21 assume !(~q <= 0); 120733#L22 assume ~q > ~p; 120714#L22-1 call #t~ret0 := parts(~p, ~p);< 121093#$Ultimate##0 ~p := #in~p;~q := #in~q; 121092#L20 assume !(~p <= 0); 121091#L21 assume !(~q <= 0); 121090#L22 assume !(~q > ~p); 120724#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121084#$Ultimate##0 ~p := #in~p;~q := #in~q; 121089#L20 assume ~p <= 0;#res := 1; 121088#partsFINAL assume true; 120723#partsEXIT >#64#return; 120720#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120721#$Ultimate##0 ~p := #in~p;~q := #in~q; 120728#L20 assume !(~p <= 0); 120727#L21 assume ~q <= 0;#res := 0; 120722#partsFINAL assume true; 120719#partsEXIT >#66#return; 120718#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120717#partsFINAL assume true; 120710#partsEXIT >#62#return; 120715#L22-2 #res := #t~ret0;havoc #t~ret0; 120823#partsFINAL assume true; 120817#partsEXIT >#68#return; 120815#L36-1 havoc main_#t~ret8#1; 120649#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120647#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120631#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120632#$Ultimate##0 ~p := #in~p;~q := #in~q; 120650#L20 assume !(~p <= 0); 120648#L21 assume !(~q <= 0); 120645#L22 assume ~q > ~p; 120646#L22-1 call #t~ret0 := parts(~p, ~p);< 120684#$Ultimate##0 ~p := #in~p;~q := #in~q; 120682#L20 assume !(~p <= 0); 120680#L21 assume !(~q <= 0); 120677#L22 assume !(~q > ~p); 120667#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120669#$Ultimate##0 ~p := #in~p;~q := #in~q; 120675#L20 assume ~p <= 0;#res := 1; 120673#partsFINAL assume true; 120666#partsEXIT >#64#return; 120658#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120663#$Ultimate##0 ~p := #in~p;~q := #in~q; 120674#L20 assume !(~p <= 0); 120672#L21 assume ~q <= 0;#res := 0; 120665#partsFINAL assume true; 120657#partsEXIT >#66#return; 120659#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120702#partsFINAL assume true; 120699#partsEXIT >#62#return; 120700#L22-2 #res := #t~ret0;havoc #t~ret0; 120816#partsFINAL assume true; 120630#partsEXIT >#68#return; 120626#L36-1 [2023-02-15 14:15:28,826 INFO L750 eck$LassoCheckResult]: Loop: 120626#L36-1 havoc main_#t~ret8#1; 120625#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120624#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 120580#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 120581#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 120635#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120628#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120629#$Ultimate##0 ~p := #in~p;~q := #in~q; 120637#L20 assume !(~p <= 0); 120636#L21 assume ~q <= 0;#res := 0; 120634#partsFINAL assume true; 120627#partsEXIT >#68#return; 120617#L36-1 havoc main_#t~ret8#1; 120610#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120584#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120571#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120572#$Ultimate##0 ~p := #in~p;~q := #in~q; 121036#L20 assume !(~p <= 0); 121035#L21 assume !(~q <= 0); 121033#L22 assume !(~q > ~p); 121030#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121031#$Ultimate##0 ~p := #in~p;~q := #in~q; 121167#L20 assume !(~p <= 0); 121166#L21 assume !(~q <= 0); 121165#L22 assume !(~q > ~p); 121162#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121164#$Ultimate##0 ~p := #in~p;~q := #in~q; 121173#L20 assume !(~p <= 0); 121172#L21 assume !(~q <= 0); 121170#L22 assume !(~q > ~p); 121171#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121185#$Ultimate##0 ~p := #in~p;~q := #in~q; 121189#L20 assume ~p <= 0;#res := 1; 121187#partsFINAL assume true; 121184#partsEXIT >#64#return; 121181#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121182#$Ultimate##0 ~p := #in~p;~q := #in~q; 121188#L20 assume !(~p <= 0); 121186#L21 assume ~q <= 0;#res := 0; 121183#partsFINAL assume true; 121180#partsEXIT >#66#return; 121159#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121179#partsFINAL assume true; 121161#partsEXIT >#64#return; 121158#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121160#$Ultimate##0 ~p := #in~p;~q := #in~q; 121174#L20 assume !(~p <= 0); 121169#L21 assume ~q <= 0;#res := 0; 121168#partsFINAL assume true; 121156#partsEXIT >#66#return; 121152#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121078#partsFINAL assume true; 121029#partsEXIT >#64#return; 121026#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121027#$Ultimate##0 ~p := #in~p;~q := #in~q; 121034#L20 assume !(~p <= 0); 121032#L21 assume ~q <= 0;#res := 0; 121028#partsFINAL assume true; 121025#partsEXIT >#66#return; 121024#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121023#partsFINAL assume true; 121022#partsEXIT >#68#return; 121021#L36-1 havoc main_#t~ret8#1; 120913#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120889#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120885#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120887#$Ultimate##0 ~p := #in~p;~q := #in~q; 121151#L20 assume !(~p <= 0); 121150#L21 assume !(~q <= 0); 121149#L22 assume !(~q > ~p); 120945#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120995#$Ultimate##0 ~p := #in~p;~q := #in~q; 121009#L20 assume !(~p <= 0); 121005#L21 assume !(~q <= 0); 121003#L22 assume ~q > ~p; 121000#L22-1 call #t~ret0 := parts(~p, ~p);< 121001#$Ultimate##0 ~p := #in~p;~q := #in~q; 121020#L20 assume !(~p <= 0); 121019#L21 assume !(~q <= 0); 121016#L22 assume !(~q > ~p); 121012#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121013#$Ultimate##0 ~p := #in~p;~q := #in~q; 121018#L20 assume ~p <= 0;#res := 1; 121015#partsFINAL assume true; 121011#partsEXIT >#64#return; 121007#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121008#$Ultimate##0 ~p := #in~p;~q := #in~q; 121017#L20 assume !(~p <= 0); 121014#L21 assume ~q <= 0;#res := 0; 121010#partsFINAL assume true; 121006#partsEXIT >#66#return; 121004#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121002#partsFINAL assume true; 120999#partsEXIT >#62#return; 120998#L22-2 #res := #t~ret0;havoc #t~ret0; 120997#partsFINAL assume true; 120994#partsEXIT >#64#return; 120904#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120909#$Ultimate##0 ~p := #in~p;~q := #in~q; 120991#L20 assume !(~p <= 0); 120989#L21 assume !(~q <= 0); 120988#L22 assume !(~q > ~p); 120983#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120986#$Ultimate##0 ~p := #in~p;~q := #in~q; 121134#L20 assume !(~p <= 0); 121129#L21 assume !(~q <= 0); 121130#L22 assume !(~q > ~p); 121118#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121136#$Ultimate##0 ~p := #in~p;~q := #in~q; 121135#L20 assume !(~p <= 0); 121132#L21 assume !(~q <= 0); 121128#L22 assume !(~q > ~p); 121114#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121115#$Ultimate##0 ~p := #in~p;~q := #in~q; 121126#L20 assume ~p <= 0;#res := 1; 121116#partsFINAL assume true; 121112#partsEXIT >#64#return; 121109#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121111#$Ultimate##0 ~p := #in~p;~q := #in~q; 121131#L20 assume !(~p <= 0); 121127#L21 assume ~q <= 0;#res := 0; 121124#partsFINAL assume true; 121107#partsEXIT >#66#return; 121110#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121175#partsFINAL assume true; 121146#partsEXIT >#64#return; 121142#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121144#$Ultimate##0 ~p := #in~p;~q := #in~q; 121148#L20 assume !(~p <= 0); 121147#L21 assume ~q <= 0;#res := 0; 121145#partsFINAL assume true; 121141#partsEXIT >#66#return; 121140#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121138#partsFINAL assume true; 120982#partsEXIT >#64#return; 120927#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120928#$Ultimate##0 ~p := #in~p;~q := #in~q; 120952#L20 assume !(~p <= 0); 120949#L21 assume ~q <= 0;#res := 0; 120946#partsFINAL assume true; 120924#partsEXIT >#66#return; 120921#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120919#partsFINAL assume true; 120903#partsEXIT >#66#return; 120901#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120899#partsFINAL assume true; 120884#partsEXIT >#68#return; 120876#L36-1 havoc main_#t~ret8#1; 120877#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 121591#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120705#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120869#$Ultimate##0 ~p := #in~p;~q := #in~q; 120951#L20 assume !(~p <= 0); 120948#L21 assume !(~q <= 0); 120944#L22 assume !(~q > ~p); 120896#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120897#$Ultimate##0 ~p := #in~p;~q := #in~q; 120930#L20 assume ~p <= 0;#res := 1; 120923#partsFINAL assume true; 120895#partsEXIT >#64#return; 120879#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120880#$Ultimate##0 ~p := #in~p;~q := #in~q; 121104#L20 assume !(~p <= 0); 121103#L21 assume !(~q <= 0); 121102#L22 assume !(~q > ~p); 121038#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121040#$Ultimate##0 ~p := #in~p;~q := #in~q; 121053#L20 assume !(~p <= 0); 121049#L21 assume !(~q <= 0); 121047#L22 assume ~q > ~p; 121044#L22-1 call #t~ret0 := parts(~p, ~p);< 121045#$Ultimate##0 ~p := #in~p;~q := #in~q; 121064#L20 assume !(~p <= 0); 121063#L21 assume !(~q <= 0); 121060#L22 assume !(~q > ~p); 121056#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121057#$Ultimate##0 ~p := #in~p;~q := #in~q; 121062#L20 assume ~p <= 0;#res := 1; 121059#partsFINAL assume true; 121055#partsEXIT >#64#return; 121051#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121052#$Ultimate##0 ~p := #in~p;~q := #in~q; 121061#L20 assume !(~p <= 0); 121058#L21 assume ~q <= 0;#res := 0; 121054#partsFINAL assume true; 121050#partsEXIT >#66#return; 121048#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121046#partsFINAL assume true; 121043#partsEXIT >#62#return; 121042#L22-2 #res := #t~ret0;havoc #t~ret0; 121041#partsFINAL assume true; 121037#partsEXIT >#64#return; 120905#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120909#$Ultimate##0 ~p := #in~p;~q := #in~q; 120991#L20 assume !(~p <= 0); 120989#L21 assume !(~q <= 0); 120988#L22 assume !(~q > ~p); 120983#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120986#$Ultimate##0 ~p := #in~p;~q := #in~q; 121134#L20 assume !(~p <= 0); 121129#L21 assume !(~q <= 0); 121130#L22 assume !(~q > ~p); 121118#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121136#$Ultimate##0 ~p := #in~p;~q := #in~q; 121135#L20 assume !(~p <= 0); 121132#L21 assume !(~q <= 0); 121128#L22 assume !(~q > ~p); 121114#L23 call #t~ret1 := parts(~p - ~q, ~q);< 121115#$Ultimate##0 ~p := #in~p;~q := #in~q; 121126#L20 assume ~p <= 0;#res := 1; 121116#partsFINAL assume true; 121112#partsEXIT >#64#return; 121109#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121111#$Ultimate##0 ~p := #in~p;~q := #in~q; 121131#L20 assume !(~p <= 0); 121127#L21 assume ~q <= 0;#res := 0; 121124#partsFINAL assume true; 121107#partsEXIT >#66#return; 121110#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121175#partsFINAL assume true; 121146#partsEXIT >#64#return; 121142#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 121144#$Ultimate##0 ~p := #in~p;~q := #in~q; 121148#L20 assume !(~p <= 0); 121147#L21 assume ~q <= 0;#res := 0; 121145#partsFINAL assume true; 121141#partsEXIT >#66#return; 121140#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121138#partsFINAL assume true; 120982#partsEXIT >#64#return; 120927#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120928#$Ultimate##0 ~p := #in~p;~q := #in~q; 120952#L20 assume !(~p <= 0); 120949#L21 assume ~q <= 0;#res := 0; 120946#partsFINAL assume true; 120924#partsEXIT >#66#return; 120921#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120919#partsFINAL assume true; 120903#partsEXIT >#66#return; 120907#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121586#partsFINAL assume true; 121585#partsEXIT >#66#return; 121584#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 121582#partsFINAL assume true; 120868#partsEXIT >#68#return; 120861#L36-1 havoc main_#t~ret8#1; 120694#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 120690#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 120604#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 120688#$Ultimate##0 ~p := #in~p;~q := #in~q; 120687#L20 assume !(~p <= 0); 120686#L21 assume !(~q <= 0); 120685#L22 assume ~q > ~p; 120603#L22-1 call #t~ret0 := parts(~p, ~p);< 120605#$Ultimate##0 ~p := #in~p;~q := #in~q; 120683#L20 assume !(~p <= 0); 120681#L21 assume !(~q <= 0); 120678#L22 assume !(~q > ~p); 120668#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120671#$Ultimate##0 ~p := #in~p;~q := #in~q; 120679#L20 assume ~p <= 0;#res := 1; 120676#partsFINAL assume true; 120670#partsEXIT >#64#return; 120661#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120664#$Ultimate##0 ~p := #in~p;~q := #in~q; 120763#L20 assume !(~p <= 0); 120760#L21 assume !(~q <= 0); 120755#L22 assume !(~q > ~p); 120756#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120766#$Ultimate##0 ~p := #in~p;~q := #in~q; 120809#L20 assume !(~p <= 0); 120806#L21 assume !(~q <= 0); 120805#L22 assume !(~q > ~p); 120777#L23 call #t~ret1 := parts(~p - ~q, ~q);< 120576#$Ultimate##0 ~p := #in~p;~q := #in~q; 120783#L20 assume ~p <= 0;#res := 1; 120779#partsFINAL assume true; 120776#partsEXIT >#64#return; 120773#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120775#$Ultimate##0 ~p := #in~p;~q := #in~q; 120804#L20 assume !(~p <= 0); 120803#L21 assume ~q <= 0;#res := 0; 120791#partsFINAL assume true; 120772#partsEXIT >#66#return; 120770#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120768#partsFINAL assume true; 120764#partsEXIT >#64#return; 120743#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 120762#$Ultimate##0 ~p := #in~p;~q := #in~q; 120788#L20 assume !(~p <= 0); 120787#L21 assume ~q <= 0;#res := 0; 120761#partsFINAL assume true; 120742#partsEXIT >#66#return; 120739#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120736#partsFINAL assume true; 120660#partsEXIT >#66#return; 120656#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 120655#partsFINAL assume true; 120654#partsEXIT >#62#return; 120612#L22-2 #res := #t~ret0;havoc #t~ret0; 120613#partsFINAL assume true; 120691#partsEXIT >#68#return; 120626#L36-1 [2023-02-15 14:15:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 726159332, now seen corresponding path program 9 times [2023-02-15 14:15:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:28,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136378979] [2023-02-15 14:15:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:28,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:28,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1783226184, now seen corresponding path program 7 times [2023-02-15 14:15:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:28,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277041884] [2023-02-15 14:15:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-02-15 14:15:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-02-15 14:15:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-02-15 14:15:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 1048 proven. 651 refuted. 0 times theorem prover too weak. 2955 trivial. 0 not checked. [2023-02-15 14:15:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277041884] [2023-02-15 14:15:29,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277041884] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147102659] [2023-02-15 14:15:29,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 14:15:29,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:29,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:29,414 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:29,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2023-02-15 14:15:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:29,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:29,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 743 proven. 635 refuted. 0 times theorem prover too weak. 3276 trivial. 0 not checked. [2023-02-15 14:15:29,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 729 proven. 665 refuted. 0 times theorem prover too weak. 3260 trivial. 0 not checked. [2023-02-15 14:15:30,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147102659] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:30,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:30,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 18] total 36 [2023-02-15 14:15:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889912060] [2023-02-15 14:15:30,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:30,733 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 14:15:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 14:15:30,734 INFO L87 Difference]: Start difference. First operand 1037 states and 1142 transitions. cyclomatic complexity: 116 Second operand has 37 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 23 states have call successors, (33), 1 states have call predecessors, (33), 13 states have return successors, (39), 21 states have call predecessors, (39), 23 states have call successors, (39) [2023-02-15 14:15:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:32,115 INFO L93 Difference]: Finished difference Result 1399 states and 1598 transitions. [2023-02-15 14:15:32,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1399 states and 1598 transitions. [2023-02-15 14:15:32,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:32,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1399 states to 975 states and 1072 transitions. [2023-02-15 14:15:32,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2023-02-15 14:15:32,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2023-02-15 14:15:32,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 975 states and 1072 transitions. [2023-02-15 14:15:32,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:32,123 INFO L218 hiAutomatonCegarLoop]: Abstraction has 975 states and 1072 transitions. [2023-02-15 14:15:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states and 1072 transitions. [2023-02-15 14:15:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 882. [2023-02-15 14:15:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 635 states have (on average 1.022047244094488) internal successors, (649), 642 states have internal predecessors, (649), 134 states have call successors, (146), 115 states have call predecessors, (146), 113 states have return successors, (162), 124 states have call predecessors, (162), 134 states have call successors, (162) [2023-02-15 14:15:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 957 transitions. [2023-02-15 14:15:32,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 882 states and 957 transitions. [2023-02-15 14:15:32,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 14:15:32,170 INFO L428 stractBuchiCegarLoop]: Abstraction has 882 states and 957 transitions. [2023-02-15 14:15:32,170 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2023-02-15 14:15:32,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 882 states and 957 transitions. [2023-02-15 14:15:32,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:32,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:32,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:32,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 16, 9, 8, 8, 8, 7, 7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:15:32,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2023-02-15 14:15:32,176 INFO L748 eck$LassoCheckResult]: Stem: 125850#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 125819#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; 125820#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 125813#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; 125814#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 125864#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125920#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125921#$Ultimate##0 ~p := #in~p;~q := #in~q; 125923#L20 assume ~p <= 0;#res := 1; 125922#partsFINAL assume true; 125919#partsEXIT >#68#return; 125918#L36-1 havoc main_#t~ret8#1; 125917#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125915#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125912#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125913#$Ultimate##0 ~p := #in~p;~q := #in~q; 125916#L20 assume ~p <= 0;#res := 1; 125914#partsFINAL assume true; 125911#partsEXIT >#68#return; 125910#L36-1 havoc main_#t~ret8#1; 125909#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125907#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125905#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125900#$Ultimate##0 ~p := #in~p;~q := #in~q; 125908#L20 assume ~p <= 0;#res := 1; 125906#partsFINAL assume true; 125904#partsEXIT >#68#return; 125903#L36-1 havoc main_#t~ret8#1; 125902#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125901#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125883#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125899#$Ultimate##0 ~p := #in~p;~q := #in~q; 125896#L20 assume ~p <= 0;#res := 1; 125897#partsFINAL assume true; 125882#partsEXIT >#68#return; 125874#L36-1 havoc main_#t~ret8#1; 125875#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125868#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 125869#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 125865#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 125866#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 126197#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 126198#$Ultimate##0 ~p := #in~p;~q := #in~q; 126215#L20 assume !(~p <= 0); 126214#L21 assume ~q <= 0;#res := 0; 126213#partsFINAL assume true; 126196#partsEXIT >#68#return; 126194#L36-1 havoc main_#t~ret8#1; 126192#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126191#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 126189#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 126190#$Ultimate##0 ~p := #in~p;~q := #in~q; 126212#L20 assume !(~p <= 0); 126211#L21 assume !(~q <= 0); 126208#L22 assume !(~q > ~p); 126204#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126205#$Ultimate##0 ~p := #in~p;~q := #in~q; 126210#L20 assume ~p <= 0;#res := 1; 126207#partsFINAL assume true; 126203#partsEXIT >#64#return; 126200#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126201#$Ultimate##0 ~p := #in~p;~q := #in~q; 126209#L20 assume !(~p <= 0); 126206#L21 assume ~q <= 0;#res := 0; 126202#partsFINAL assume true; 126199#partsEXIT >#66#return; 126195#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126193#partsFINAL assume true; 126188#partsEXIT >#68#return; 126185#L36-1 havoc main_#t~ret8#1; 126186#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125833#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125817#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125818#$Ultimate##0 ~p := #in~p;~q := #in~q; 126520#L20 assume !(~p <= 0); 126518#L21 assume !(~q <= 0); 126516#L22 assume ~q > ~p; 126490#L22-1 call #t~ret0 := parts(~p, ~p);< 126515#$Ultimate##0 ~p := #in~p;~q := #in~q; 126513#L20 assume !(~p <= 0); 126511#L21 assume !(~q <= 0); 126509#L22 assume !(~q > ~p); 126507#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126508#$Ultimate##0 ~p := #in~p;~q := #in~q; 126519#L20 assume ~p <= 0;#res := 1; 126517#partsFINAL assume true; 126506#partsEXIT >#64#return; 126502#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126503#$Ultimate##0 ~p := #in~p;~q := #in~q; 126525#L20 assume !(~p <= 0); 126524#L21 assume ~q <= 0;#res := 0; 126522#partsFINAL assume true; 126501#partsEXIT >#66#return; 126500#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126498#partsFINAL assume true; 126489#partsEXIT >#62#return; 126493#L22-2 #res := #t~ret0;havoc #t~ret0; 126528#partsFINAL assume true; 126481#partsEXIT >#68#return; 126479#L36-1 havoc main_#t~ret8#1; 126477#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126472#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125852#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125880#$Ultimate##0 ~p := #in~p;~q := #in~q; 126487#L20 assume !(~p <= 0); 126485#L21 assume !(~q <= 0); 126484#L22 assume ~q > ~p; 126226#L22-1 call #t~ret0 := parts(~p, ~p);< 126254#$Ultimate##0 ~p := #in~p;~q := #in~q; 126251#L20 assume !(~p <= 0); 126248#L21 assume !(~q <= 0); 126244#L22 assume !(~q > ~p); 126233#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126235#$Ultimate##0 ~p := #in~p;~q := #in~q; 126239#L20 assume ~p <= 0;#res := 1; 126237#partsFINAL assume true; 126232#partsEXIT >#64#return; 126222#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126228#$Ultimate##0 ~p := #in~p;~q := #in~q; 126238#L20 assume !(~p <= 0); 126236#L21 assume ~q <= 0;#res := 0; 126231#partsFINAL assume true; 126221#partsEXIT >#66#return; 126223#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126499#partsFINAL assume true; 126476#partsEXIT >#62#return; 125851#L22-2 #res := #t~ret0;havoc #t~ret0; 125853#partsFINAL assume true; 125879#partsEXIT >#68#return; 125873#L36-1 [2023-02-15 14:15:32,177 INFO L750 eck$LassoCheckResult]: Loop: 125873#L36-1 havoc main_#t~ret8#1; 125870#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125867#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 125824#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 125825#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 125888#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125877#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125878#$Ultimate##0 ~p := #in~p;~q := #in~q; 125890#L20 assume !(~p <= 0); 125889#L21 assume ~q <= 0;#res := 0; 125887#partsFINAL assume true; 125876#partsEXIT >#68#return; 125861#L36-1 havoc main_#t~ret8#1; 125856#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125832#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125815#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 125816#$Ultimate##0 ~p := #in~p;~q := #in~q; 126650#L20 assume !(~p <= 0); 126649#L21 assume !(~q <= 0); 126620#L22 assume !(~q > ~p); 126349#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126350#$Ultimate##0 ~p := #in~p;~q := #in~q; 126565#L20 assume !(~p <= 0); 126564#L21 assume !(~q <= 0); 126563#L22 assume !(~q > ~p); 125810#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126562#$Ultimate##0 ~p := #in~p;~q := #in~q; 126609#L20 assume !(~p <= 0); 126608#L21 assume !(~q <= 0); 126607#L22 assume !(~q > ~p); 125822#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125823#$Ultimate##0 ~p := #in~p;~q := #in~q; 126676#L20 assume ~p <= 0;#res := 1; 126674#partsFINAL assume true; 126675#partsEXIT >#64#return; 125805#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125812#$Ultimate##0 ~p := #in~p;~q := #in~q; 126679#L20 assume !(~p <= 0); 126677#L21 assume ~q <= 0;#res := 0; 126678#partsFINAL assume true; 125804#partsEXIT >#66#return; 125806#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125845#partsFINAL assume true; 125860#partsEXIT >#64#return; 126560#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126561#$Ultimate##0 ~p := #in~p;~q := #in~q; 126604#L20 assume !(~p <= 0); 126601#L21 assume ~q <= 0;#res := 0; 126566#partsFINAL assume true; 126558#partsEXIT >#66#return; 126557#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126556#partsFINAL assume true; 126348#partsEXIT >#64#return; 126341#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126342#$Ultimate##0 ~p := #in~p;~q := #in~q; 126460#L20 assume !(~p <= 0); 126452#L21 assume ~q <= 0;#res := 0; 126447#partsFINAL assume true; 126340#partsEXIT >#66#return; 126335#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126333#partsFINAL assume true; 126328#partsEXIT >#68#return; 126326#L36-1 havoc main_#t~ret8#1; 126324#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126322#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 126319#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 126320#$Ultimate##0 ~p := #in~p;~q := #in~q; 126635#L20 assume !(~p <= 0); 126634#L21 assume !(~q <= 0); 126633#L22 assume !(~q > ~p); 125848#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126630#$Ultimate##0 ~p := #in~p;~q := #in~q; 126629#L20 assume !(~p <= 0); 126599#L21 assume !(~q <= 0); 126600#L22 assume ~q > ~p; 125847#L22-1 call #t~ret0 := parts(~p, ~p);< 125849#$Ultimate##0 ~p := #in~p;~q := #in~q; 126587#L20 assume !(~p <= 0); 126588#L21 assume !(~q <= 0); 126581#L22 assume !(~q > ~p); 126582#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126593#$Ultimate##0 ~p := #in~p;~q := #in~q; 126594#L20 assume ~p <= 0;#res := 1; 126585#partsFINAL assume true; 126586#partsEXIT >#64#return; 126574#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126575#$Ultimate##0 ~p := #in~p;~q := #in~q; 126610#L20 assume !(~p <= 0); 126605#L21 assume ~q <= 0;#res := 0; 126595#partsFINAL assume true; 126573#partsEXIT >#66#return; 126571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126569#partsFINAL assume true; 126567#partsEXIT >#62#return; 125854#L22-2 #res := #t~ret0;havoc #t~ret0; 125855#partsFINAL assume true; 126644#partsEXIT >#64#return; 126362#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126367#$Ultimate##0 ~p := #in~p;~q := #in~q; 126572#L20 assume !(~p <= 0); 126570#L21 assume !(~q <= 0); 126568#L22 assume !(~q > ~p); 126345#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126347#$Ultimate##0 ~p := #in~p;~q := #in~q; 126387#L20 assume !(~p <= 0); 126382#L21 assume !(~q <= 0); 126383#L22 assume !(~q > ~p); 126385#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126393#$Ultimate##0 ~p := #in~p;~q := #in~q; 126392#L20 assume !(~p <= 0); 126389#L21 assume !(~q <= 0); 126388#L22 assume !(~q > ~p); 126379#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126380#$Ultimate##0 ~p := #in~p;~q := #in~q; 126391#L20 assume ~p <= 0;#res := 1; 126384#partsFINAL assume true; 126377#partsEXIT >#64#return; 126373#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126376#$Ultimate##0 ~p := #in~p;~q := #in~q; 126430#L20 assume !(~p <= 0); 126428#L21 assume ~q <= 0;#res := 0; 126394#partsFINAL assume true; 126372#partsEXIT >#66#return; 126375#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126680#partsFINAL assume true; 126673#partsEXIT >#64#return; 125838#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125841#$Ultimate##0 ~p := #in~p;~q := #in~q; 125842#L20 assume !(~p <= 0); 125836#L21 assume ~q <= 0;#res := 0; 125839#partsFINAL assume true; 126672#partsEXIT >#66#return; 126671#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126670#partsFINAL assume true; 126459#partsEXIT >#64#return; 126450#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126451#$Ultimate##0 ~p := #in~p;~q := #in~q; 126456#L20 assume !(~p <= 0); 126454#L21 assume ~q <= 0;#res := 0; 126453#partsFINAL assume true; 126449#partsEXIT >#66#return; 126448#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126369#partsFINAL assume true; 126361#partsEXIT >#66#return; 126359#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126357#partsFINAL assume true; 126318#partsEXIT >#68#return; 126316#L36-1 havoc main_#t~ret8#1; 126314#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126312#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 126301#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 126310#$Ultimate##0 ~p := #in~p;~q := #in~q; 126308#L20 assume !(~p <= 0); 126306#L21 assume !(~q <= 0); 126304#L22 assume !(~q > ~p); 126283#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126285#$Ultimate##0 ~p := #in~p;~q := #in~q; 126351#L20 assume ~p <= 0;#res := 1; 126300#partsFINAL assume true; 126281#partsEXIT >#64#return; 126284#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126401#$Ultimate##0 ~p := #in~p;~q := #in~q; 126416#L20 assume !(~p <= 0); 126414#L21 assume !(~q <= 0); 126413#L22 assume !(~q > ~p); 126411#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126412#$Ultimate##0 ~p := #in~p;~q := #in~q; 126426#L20 assume !(~p <= 0); 126425#L21 assume !(~q <= 0); 126424#L22 assume ~q > ~p; 126421#L22-1 call #t~ret0 := parts(~p, ~p);< 126422#$Ultimate##0 ~p := #in~p;~q := #in~q; 126440#L20 assume !(~p <= 0); 126438#L21 assume !(~q <= 0); 126437#L22 assume !(~q > ~p); 126435#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126436#$Ultimate##0 ~p := #in~p;~q := #in~q; 126441#L20 assume ~p <= 0;#res := 1; 126439#partsFINAL assume true; 126434#partsEXIT >#64#return; 126432#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126433#$Ultimate##0 ~p := #in~p;~q := #in~q; 126446#L20 assume !(~p <= 0); 126444#L21 assume ~q <= 0;#res := 0; 126442#partsFINAL assume true; 126431#partsEXIT >#66#return; 126429#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126427#partsFINAL assume true; 126420#partsEXIT >#62#return; 126419#L22-2 #res := #t~ret0;havoc #t~ret0; 126415#partsFINAL assume true; 126409#partsEXIT >#64#return; 126364#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126367#$Ultimate##0 ~p := #in~p;~q := #in~q; 126572#L20 assume !(~p <= 0); 126570#L21 assume !(~q <= 0); 126568#L22 assume !(~q > ~p); 126345#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126347#$Ultimate##0 ~p := #in~p;~q := #in~q; 126387#L20 assume !(~p <= 0); 126382#L21 assume !(~q <= 0); 126383#L22 assume !(~q > ~p); 126385#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126393#$Ultimate##0 ~p := #in~p;~q := #in~q; 126392#L20 assume !(~p <= 0); 126389#L21 assume !(~q <= 0); 126388#L22 assume !(~q > ~p); 126379#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126380#$Ultimate##0 ~p := #in~p;~q := #in~q; 126391#L20 assume ~p <= 0;#res := 1; 126384#partsFINAL assume true; 126377#partsEXIT >#64#return; 126373#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126376#$Ultimate##0 ~p := #in~p;~q := #in~q; 126430#L20 assume !(~p <= 0); 126428#L21 assume ~q <= 0;#res := 0; 126394#partsFINAL assume true; 126372#partsEXIT >#66#return; 126375#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126680#partsFINAL assume true; 126673#partsEXIT >#64#return; 125838#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125841#$Ultimate##0 ~p := #in~p;~q := #in~q; 125842#L20 assume !(~p <= 0); 125836#L21 assume ~q <= 0;#res := 0; 125839#partsFINAL assume true; 126672#partsEXIT >#66#return; 126671#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126670#partsFINAL assume true; 126459#partsEXIT >#64#return; 126450#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126451#$Ultimate##0 ~p := #in~p;~q := #in~q; 126456#L20 assume !(~p <= 0); 126454#L21 assume ~q <= 0;#res := 0; 126453#partsFINAL assume true; 126449#partsEXIT >#66#return; 126448#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126369#partsFINAL assume true; 126361#partsEXIT >#66#return; 126365#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126405#partsFINAL assume true; 126400#partsEXIT >#66#return; 126398#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126397#partsFINAL assume true; 126396#partsEXIT >#68#return; 126329#L36-1 havoc main_#t~ret8#1; 126327#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 126325#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 125829#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 126323#$Ultimate##0 ~p := #in~p;~q := #in~q; 126606#L20 assume !(~p <= 0); 126598#L21 assume !(~q <= 0); 125828#L22 assume ~q > ~p; 125830#L22-1 call #t~ret0 := parts(~p, ~p);< 125846#$Ultimate##0 ~p := #in~p;~q := #in~q; 126253#L20 assume !(~p <= 0); 126250#L21 assume !(~q <= 0); 126246#L22 assume !(~q > ~p); 126241#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126242#$Ultimate##0 ~p := #in~p;~q := #in~q; 126247#L20 assume ~p <= 0;#res := 1; 126243#partsFINAL assume true; 126240#partsEXIT >#64#return; 126229#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126230#$Ultimate##0 ~p := #in~p;~q := #in~q; 126631#L20 assume !(~p <= 0); 126632#L21 assume !(~q <= 0); 126624#L22 assume !(~q > ~p); 126597#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126622#$Ultimate##0 ~p := #in~p;~q := #in~q; 126602#L20 assume !(~p <= 0); 126603#L21 assume !(~q <= 0); 126596#L22 assume ~q > ~p; 126579#L22-1 call #t~ret0 := parts(~p, ~p);< 126591#$Ultimate##0 ~p := #in~p;~q := #in~q; 126592#L20 assume !(~p <= 0); 126583#L21 assume !(~q <= 0); 126584#L22 assume !(~q > ~p); 126577#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126580#$Ultimate##0 ~p := #in~p;~q := #in~q; 126589#L20 assume ~p <= 0;#res := 1; 126590#partsFINAL assume true; 126576#partsEXIT >#64#return; 126578#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126640#$Ultimate##0 ~p := #in~p;~q := #in~q; 126643#L20 assume !(~p <= 0); 126642#L21 assume ~q <= 0;#res := 0; 126641#partsFINAL assume true; 126639#partsEXIT >#66#return; 126638#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126637#partsFINAL assume true; 126628#partsEXIT >#62#return; 126625#L22-2 #res := #t~ret0;havoc #t~ret0; 126623#partsFINAL assume true; 126621#partsEXIT >#64#return; 126531#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126532#$Ultimate##0 ~p := #in~p;~q := #in~q; 126618#L20 assume !(~p <= 0); 126616#L21 assume !(~q <= 0); 126615#L22 assume !(~q > ~p); 126544#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126546#$Ultimate##0 ~p := #in~p;~q := #in~q; 126553#L20 assume !(~p <= 0); 126554#L21 assume !(~q <= 0); 126653#L22 assume !(~q > ~p); 125808#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126652#$Ultimate##0 ~p := #in~p;~q := #in~q; 126654#L20 assume !(~p <= 0); 126551#L21 assume !(~q <= 0); 126552#L22 assume !(~q > ~p); 125801#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125821#$Ultimate##0 ~p := #in~p;~q := #in~q; 125840#L20 assume ~p <= 0;#res := 1; 125863#partsFINAL assume true; 125799#partsEXIT >#64#return; 125803#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125809#$Ultimate##0 ~p := #in~p;~q := #in~q; 126666#L20 assume !(~p <= 0); 125834#L21 assume ~q <= 0;#res := 0; 125835#partsFINAL assume true; 126669#partsEXIT >#66#return; 125843#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 125844#partsFINAL assume true; 125859#partsEXIT >#64#return; 126646#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126648#$Ultimate##0 ~p := #in~p;~q := #in~q; 126656#L20 assume !(~p <= 0); 126655#L21 assume ~q <= 0;#res := 0; 126651#partsFINAL assume true; 126645#partsEXIT >#66#return; 126619#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126614#partsFINAL assume true; 126543#partsEXIT >#64#return; 126539#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126540#$Ultimate##0 ~p := #in~p;~q := #in~q; 126549#L20 assume !(~p <= 0); 126548#L21 assume ~q <= 0;#res := 0; 126542#partsFINAL assume true; 126538#partsEXIT >#66#return; 126536#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126534#partsFINAL assume true; 126530#partsEXIT >#66#return; 126527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126526#partsFINAL assume true; 126497#partsEXIT >#66#return; 126496#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 126495#partsFINAL assume true; 126475#partsEXIT >#62#return; 126473#L22-2 #res := #t~ret0;havoc #t~ret0; 126470#partsFINAL assume true; 126465#partsEXIT >#68#return; 125873#L36-1 [2023-02-15 14:15:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 726159332, now seen corresponding path program 10 times [2023-02-15 14:15:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:32,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126044552] [2023-02-15 14:15:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:32,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:32,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 395303819, now seen corresponding path program 8 times [2023-02-15 14:15:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:32,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760751056] [2023-02-15 14:15:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:32,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:32,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:32,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1332197560, now seen corresponding path program 11 times [2023-02-15 14:15:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:32,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279784379] [2023-02-15 14:15:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 14:15:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 14:15:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-15 14:15:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-15 14:15:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 14:15:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-02-15 14:15:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-02-15 14:15:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-02-15 14:15:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-02-15 14:15:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-02-15 14:15:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11010 backedges. 370 proven. 858 refuted. 0 times theorem prover too weak. 9782 trivial. 0 not checked. [2023-02-15 14:15:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279784379] [2023-02-15 14:15:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279784379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736388268] [2023-02-15 14:15:32,807 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 14:15:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:32,810 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 14:15:32,811 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 14:15:32,996 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-15 14:15:32,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:33,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 14:15:33,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11010 backedges. 5377 proven. 195 refuted. 0 times theorem prover too weak. 5438 trivial. 0 not checked. [2023-02-15 14:15:33,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11010 backedges. 415 proven. 1011 refuted. 0 times theorem prover too weak. 9584 trivial. 0 not checked. [2023-02-15 14:15:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736388268] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:33,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:33,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 29 [2023-02-15 14:15:33,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770769697] [2023-02-15 14:15:33,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:37,033 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:37,033 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:37,033 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:37,033 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:37,033 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:15:37,033 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,033 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:37,033 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:37,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2023-02-15 14:15:37,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:37,033 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:37,033 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 14:15:37,035 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 14:15:37,036 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 14:15:37,041 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 14:15:37,046 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 14:15:37,088 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:37,088 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:15:37,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,091 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 14:15:37,091 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 14:15:37,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:37,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:37,113 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:37,113 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 14:15:37,116 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 14:15:37,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,118 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 14:15:37,120 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 14:15:37,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:37,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:37,177 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:15:37,177 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 14:15:37,180 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 14:15:37,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,181 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 14:15:37,183 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 14:15:37,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:15:37,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:37,208 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 14:15:37,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,210 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 14:15:37,212 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 14:15:37,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:15:37,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:15:37,282 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:15:37,286 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 14:15:37,288 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:15:37,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:15:37,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:15:37,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:15:37,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:15:37,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:15:37,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:15:37,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration25_Loop [2023-02-15 14:15:37,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:15:37,288 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:15:37,289 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 14:15:37,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 14:15:37,292 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 14:15:37,297 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 14:15:37,302 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 14:15:37,345 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:15:37,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:15:37,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,347 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 14:15:37,347 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 14:15:37,350 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 14:15:37,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:37,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:37,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:37,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:37,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:37,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:37,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:37,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:37,368 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 14:15:37,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,370 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 14:15:37,372 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 14:15:37,374 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 14:15:37,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:37,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:37,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:37,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:37,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:37,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:37,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:37,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:15:37,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2023-02-15 14:15:37,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,386 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 14:15:37,386 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 14:15:37,391 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 14:15:37,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:15:37,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:15:37,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:15:37,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:15:37,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:15:37,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:15:37,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:15:37,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:15:37,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:15:37,401 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:15:37,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:15:37,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:37,403 INFO L229 MonitoredProcess]: Starting monitored process 150 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 14:15:37,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2023-02-15 14:15:37,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:15:37,406 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:15:37,406 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:15:37,406 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 5 Supporting invariants [] [2023-02-15 14:15:37,410 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 14:15:37,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:15:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:37,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 14:15:37,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:38,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 2248 conjuncts, 118 conjunts are in the unsatisfiable core [2023-02-15 14:15:38,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:38,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6387 backedges. 40 proven. 881 refuted. 0 times theorem prover too weak. 5466 trivial. 0 not checked. [2023-02-15 14:15:38,757 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2023-02-15 14:15:38,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 882 states and 957 transitions. cyclomatic complexity: 85 Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 14:15:39,213 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 882 states and 957 transitions. cyclomatic complexity: 85. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) Result 2119 states and 2338 transitions. Complement of second has 101 states. [2023-02-15 14:15:39,213 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 14:15:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-15 14:15:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 101 transitions. [2023-02-15 14:15:39,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 101 transitions. Stem has 129 letters. Loop has 351 letters. [2023-02-15 14:15:39,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:39,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 101 transitions. Stem has 480 letters. Loop has 351 letters. [2023-02-15 14:15:39,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:39,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 101 transitions. Stem has 129 letters. Loop has 702 letters. [2023-02-15 14:15:39,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:15:39,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2119 states and 2338 transitions. [2023-02-15 14:15:39,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:39,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2119 states to 1773 states and 1970 transitions. [2023-02-15 14:15:39,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2023-02-15 14:15:39,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2023-02-15 14:15:39,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1773 states and 1970 transitions. [2023-02-15 14:15:39,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:39,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1773 states and 1970 transitions. [2023-02-15 14:15:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states and 1970 transitions. [2023-02-15 14:15:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1539. [2023-02-15 14:15:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1099 states have (on average 1.0291173794358508) internal successors, (1131), 1114 states have internal predecessors, (1131), 243 states have call successors, (263), 195 states have call predecessors, (263), 197 states have return successors, (298), 229 states have call predecessors, (298), 243 states have call successors, (298) [2023-02-15 14:15:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1692 transitions. [2023-02-15 14:15:39,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1539 states and 1692 transitions. [2023-02-15 14:15:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 14:15:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2023-02-15 14:15:39,256 INFO L87 Difference]: Start difference. First operand 1539 states and 1692 transitions. Second operand has 29 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 20 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (31), 15 states have call predecessors, (31), 20 states have call successors, (31) [2023-02-15 14:15:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:39,877 INFO L93 Difference]: Finished difference Result 1755 states and 1971 transitions. [2023-02-15 14:15:39,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1755 states and 1971 transitions. [2023-02-15 14:15:39,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:39,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1755 states to 1607 states and 1789 transitions. [2023-02-15 14:15:39,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2023-02-15 14:15:39,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2023-02-15 14:15:39,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1607 states and 1789 transitions. [2023-02-15 14:15:39,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:39,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1607 states and 1789 transitions. [2023-02-15 14:15:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states and 1789 transitions. [2023-02-15 14:15:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1503. [2023-02-15 14:15:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1075 states have (on average 1.026046511627907) internal successors, (1103), 1085 states have internal predecessors, (1103), 237 states have call successors, (257), 189 states have call predecessors, (257), 191 states have return successors, (296), 228 states have call predecessors, (296), 237 states have call successors, (296) [2023-02-15 14:15:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1656 transitions. [2023-02-15 14:15:39,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1503 states and 1656 transitions. [2023-02-15 14:15:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 14:15:39,902 INFO L428 stractBuchiCegarLoop]: Abstraction has 1503 states and 1656 transitions. [2023-02-15 14:15:39,903 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2023-02-15 14:15:39,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1503 states and 1656 transitions. [2023-02-15 14:15:39,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:39,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:39,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:39,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [33, 33, 22, 12, 12, 12, 12, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-02-15 14:15:39,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2023-02-15 14:15:39,906 INFO L748 eck$LassoCheckResult]: Stem: 138003#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 137961#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; 137962#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 137959#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; 137960#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 138020#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138612#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138613#$Ultimate##0 ~p := #in~p;~q := #in~q; 138617#L20 assume ~p <= 0;#res := 1; 138616#partsFINAL assume true; 138611#partsEXIT >#68#return; 138610#L36-1 havoc main_#t~ret8#1; 138609#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138608#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138605#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138606#$Ultimate##0 ~p := #in~p;~q := #in~q; 138615#L20 assume ~p <= 0;#res := 1; 138614#partsFINAL assume true; 138604#partsEXIT >#68#return; 138602#L36-1 havoc main_#t~ret8#1; 138601#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138600#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138599#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138588#$Ultimate##0 ~p := #in~p;~q := #in~q; 138607#L20 assume ~p <= 0;#res := 1; 138603#partsFINAL assume true; 138598#partsEXIT >#68#return; 138596#L36-1 havoc main_#t~ret8#1; 138594#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138592#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138586#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138587#$Ultimate##0 ~p := #in~p;~q := #in~q; 138640#L20 assume ~p <= 0;#res := 1; 138639#partsFINAL assume true; 138585#partsEXIT >#68#return; 138581#L36-1 havoc main_#t~ret8#1; 138579#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138577#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 138576#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 138021#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 138022#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138754#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138755#$Ultimate##0 ~p := #in~p;~q := #in~q; 138766#L20 assume !(~p <= 0); 138764#L21 assume ~q <= 0;#res := 0; 138759#partsFINAL assume true; 138753#partsEXIT >#68#return; 138747#L36-1 havoc main_#t~ret8#1; 138746#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138737#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138732#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138733#$Ultimate##0 ~p := #in~p;~q := #in~q; 138770#L20 assume !(~p <= 0); 138769#L21 assume !(~q <= 0); 138768#L22 assume !(~q > ~p); 138761#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138762#$Ultimate##0 ~p := #in~p;~q := #in~q; 138767#L20 assume ~p <= 0;#res := 1; 138765#partsFINAL assume true; 138760#partsEXIT >#64#return; 138744#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138745#$Ultimate##0 ~p := #in~p;~q := #in~q; 138763#L20 assume !(~p <= 0); 138758#L21 assume ~q <= 0;#res := 0; 138752#partsFINAL assume true; 138743#partsEXIT >#66#return; 138742#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138736#partsFINAL assume true; 138731#partsEXIT >#68#return; 138728#L36-1 havoc main_#t~ret8#1; 138720#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138718#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138715#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138716#$Ultimate##0 ~p := #in~p;~q := #in~q; 138970#L20 assume !(~p <= 0); 138969#L21 assume !(~q <= 0); 138968#L22 assume ~q > ~p; 138723#L22-1 call #t~ret0 := parts(~p, ~p);< 138727#$Ultimate##0 ~p := #in~p;~q := #in~q; 138964#L20 assume !(~p <= 0); 138963#L21 assume !(~q <= 0); 138961#L22 assume !(~q > ~p); 138750#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138751#$Ultimate##0 ~p := #in~p;~q := #in~q; 138878#L20 assume ~p <= 0;#res := 1; 138957#partsFINAL assume true; 138749#partsEXIT >#64#return; 138739#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138740#$Ultimate##0 ~p := #in~p;~q := #in~q; 138757#L20 assume !(~p <= 0); 138756#L21 assume ~q <= 0;#res := 0; 138748#partsFINAL assume true; 138738#partsEXIT >#66#return; 138734#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138729#partsFINAL assume true; 138721#partsEXIT >#62#return; 138719#L22-2 #res := #t~ret0;havoc #t~ret0; 138717#partsFINAL assume true; 138714#partsEXIT >#68#return; 138713#L36-1 havoc main_#t~ret8#1; 138712#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138711#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138705#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138709#$Ultimate##0 ~p := #in~p;~q := #in~q; 138708#L20 assume !(~p <= 0); 138707#L21 assume !(~q <= 0); 138706#L22 assume ~q > ~p; 138703#L22-1 call #t~ret0 := parts(~p, ~p);< 138700#$Ultimate##0 ~p := #in~p;~q := #in~q; 138835#L20 assume !(~p <= 0); 138833#L21 assume !(~q <= 0); 138831#L22 assume !(~q > ~p); 138781#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138784#$Ultimate##0 ~p := #in~p;~q := #in~q; 138830#L20 assume ~p <= 0;#res := 1; 138829#partsFINAL assume true; 138780#partsEXIT >#64#return; 138783#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138806#$Ultimate##0 ~p := #in~p;~q := #in~q; 138801#L20 assume !(~p <= 0); 138797#L21 assume ~q <= 0;#res := 0; 138792#partsFINAL assume true; 138793#partsEXIT >#66#return; 138840#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138702#partsFINAL assume true; 138704#partsEXIT >#62#return; 138839#L22-2 #res := #t~ret0;havoc #t~ret0; 138972#partsFINAL assume true; 138971#partsEXIT >#68#return; 138561#L36-1 havoc main_#t~ret8#1; 138560#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138559#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 138557#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 138554#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 138553#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138297#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138300#$Ultimate##0 ~p := #in~p;~q := #in~q; 138558#L20 assume !(~p <= 0); 138556#L21 assume ~q <= 0;#res := 0; 138552#partsFINAL assume true; 138296#partsEXIT >#68#return; 138299#L36-1 havoc main_#t~ret8#1; 138225#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138217#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138210#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138213#$Ultimate##0 ~p := #in~p;~q := #in~q; 138312#L20 assume !(~p <= 0); 138310#L21 assume !(~q <= 0); 138309#L22 assume !(~q > ~p); 138307#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138308#$Ultimate##0 ~p := #in~p;~q := #in~q; 138570#L20 assume !(~p <= 0); 138569#L21 assume !(~q <= 0); 138567#L22 assume !(~q > ~p); 138318#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138319#$Ultimate##0 ~p := #in~p;~q := #in~q; 138326#L20 assume ~p <= 0;#res := 1; 138324#partsFINAL assume true; 138317#partsEXIT >#64#return; 138315#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138316#$Ultimate##0 ~p := #in~p;~q := #in~q; 138519#L20 assume !(~p <= 0); 138517#L21 assume ~q <= 0;#res := 0; 138515#partsFINAL assume true; 138314#partsEXIT >#66#return; 138313#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138311#partsFINAL assume true; 138306#partsEXIT >#64#return; 138304#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138305#$Ultimate##0 ~p := #in~p;~q := #in~q; 138542#L20 assume !(~p <= 0); 138538#L21 assume ~q <= 0;#res := 0; 138534#partsFINAL assume true; 138303#partsEXIT >#66#return; 138301#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138290#partsFINAL assume true; 138209#partsEXIT >#68#return; 138205#L36-1 havoc main_#t~ret8#1; 138204#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138203#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138192#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138195#$Ultimate##0 ~p := #in~p;~q := #in~q; 138391#L20 assume !(~p <= 0); 138387#L21 assume !(~q <= 0); 138385#L22 assume !(~q > ~p); 138220#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138224#$Ultimate##0 ~p := #in~p;~q := #in~q; 138232#L20 assume ~p <= 0;#res := 1; 138227#partsFINAL assume true; 138218#partsEXIT >#64#return; 138215#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138216#$Ultimate##0 ~p := #in~p;~q := #in~q; 138267#L20 assume !(~p <= 0); 138266#L21 assume !(~q <= 0); 138265#L22 assume !(~q > ~p); 138258#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138259#$Ultimate##0 ~p := #in~p;~q := #in~q; 138566#L20 assume !(~p <= 0); 138565#L21 assume !(~q <= 0); 138563#L22 assume !(~q > ~p); 138275#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138277#$Ultimate##0 ~p := #in~p;~q := #in~q; 138283#L20 assume ~p <= 0;#res := 1; 138279#partsFINAL assume true; 138274#partsEXIT >#64#return; 138271#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138273#$Ultimate##0 ~p := #in~p;~q := #in~q; 138293#L20 assume !(~p <= 0); 138291#L21 assume ~q <= 0;#res := 0; 138288#partsFINAL assume true; 138269#partsEXIT >#66#return; 138268#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138263#partsFINAL assume true; 138256#partsEXIT >#64#return; 138249#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138251#$Ultimate##0 ~p := #in~p;~q := #in~q; 138555#L20 assume !(~p <= 0); 138551#L21 assume ~q <= 0;#res := 0; 138255#partsFINAL assume true; 138247#partsEXIT >#66#return; 138240#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138236#partsFINAL assume true; 138214#partsEXIT >#66#return; 138208#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138201#partsFINAL assume true; 138190#partsEXIT >#68#return; 138193#L36-1 havoc main_#t~ret8#1; 138332#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138184#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138008#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138087#$Ultimate##0 ~p := #in~p;~q := #in~q; 138085#L20 assume !(~p <= 0); 138083#L21 assume !(~q <= 0); 138078#L22 assume ~q > ~p; 138038#L22-1 call #t~ret0 := parts(~p, ~p);< 138077#$Ultimate##0 ~p := #in~p;~q := #in~q; 138074#L20 assume !(~p <= 0); 138071#L21 assume !(~q <= 0); 138062#L22 assume !(~q > ~p); 138054#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138056#$Ultimate##0 ~p := #in~p;~q := #in~q; 138060#L20 assume ~p <= 0;#res := 1; 138058#partsFINAL assume true; 138053#partsEXIT >#64#return; 138043#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138047#$Ultimate##0 ~p := #in~p;~q := #in~q; 138059#L20 assume !(~p <= 0); 138057#L21 assume ~q <= 0;#res := 0; 138052#partsFINAL assume true; 138042#partsEXIT >#66#return; 138041#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138039#partsFINAL assume true; 138040#partsEXIT >#62#return; 138175#L22-2 #res := #t~ret0;havoc #t~ret0; 138173#partsFINAL assume true; 138169#partsEXIT >#68#return; 138025#L36-1 [2023-02-15 14:15:39,907 INFO L750 eck$LassoCheckResult]: Loop: 138025#L36-1 havoc main_#t~ret8#1; 138024#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138023#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 137972#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 137973#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 137976#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 137977#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138031#$Ultimate##0 ~p := #in~p;~q := #in~q; 138034#L20 assume !(~p <= 0); 138033#L21 assume ~q <= 0;#res := 0; 138032#partsFINAL assume true; 138030#partsEXIT >#68#return; 138017#L36-1 havoc main_#t~ret8#1; 138004#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138005#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 137963#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 137964#$Ultimate##0 ~p := #in~p;~q := #in~q; 138597#L20 assume !(~p <= 0); 138595#L21 assume !(~q <= 0); 138593#L22 assume !(~q > ~p); 138590#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138591#$Ultimate##0 ~p := #in~p;~q := #in~q; 138631#L20 assume !(~p <= 0); 138630#L21 assume !(~q <= 0); 138629#L22 assume !(~q > ~p); 138627#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138628#$Ultimate##0 ~p := #in~p;~q := #in~q; 138638#L20 assume !(~p <= 0); 138636#L21 assume !(~q <= 0); 138633#L22 assume !(~q > ~p); 138626#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138628#$Ultimate##0 ~p := #in~p;~q := #in~q; 138638#L20 assume !(~p <= 0); 138636#L21 assume !(~q <= 0); 138633#L22 assume !(~q > ~p); 138634#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138663#$Ultimate##0 ~p := #in~p;~q := #in~q; 138668#L20 assume ~p <= 0;#res := 1; 138667#partsFINAL assume true; 138662#partsEXIT >#64#return; 138660#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138661#$Ultimate##0 ~p := #in~p;~q := #in~q; 138666#L20 assume !(~p <= 0); 138665#L21 assume ~q <= 0;#res := 0; 138664#partsFINAL assume true; 138659#partsEXIT >#66#return; 138658#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138656#partsFINAL assume true; 138654#partsEXIT >#64#return; 138651#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138652#$Ultimate##0 ~p := #in~p;~q := #in~q; 138657#L20 assume !(~p <= 0); 138655#L21 assume ~q <= 0;#res := 0; 138653#partsFINAL assume true; 138650#partsEXIT >#66#return; 138623#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138644#partsFINAL assume true; 138625#partsEXIT >#64#return; 138622#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138624#$Ultimate##0 ~p := #in~p;~q := #in~q; 138637#L20 assume !(~p <= 0); 138635#L21 assume ~q <= 0;#res := 0; 138632#partsFINAL assume true; 138620#partsEXIT >#66#return; 138619#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138618#partsFINAL assume true; 138589#partsEXIT >#64#return; 138583#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138584#$Ultimate##0 ~p := #in~p;~q := #in~q; 138643#L20 assume !(~p <= 0); 138642#L21 assume ~q <= 0;#res := 0; 138641#partsFINAL assume true; 138582#partsEXIT >#66#return; 138580#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138578#partsFINAL assume true; 138575#partsEXIT >#68#return; 138573#L36-1 havoc main_#t~ret8#1; 138572#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138571#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138330#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138331#$Ultimate##0 ~p := #in~p;~q := #in~q; 138499#L20 assume !(~p <= 0); 138495#L21 assume !(~q <= 0); 138469#L22 assume !(~q > ~p); 138370#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138372#$Ultimate##0 ~p := #in~p;~q := #in~q; 138394#L20 assume !(~p <= 0); 138393#L21 assume !(~q <= 0); 138392#L22 assume ~q > ~p; 138389#L22-1 call #t~ret0 := parts(~p, ~p);< 138390#$Ultimate##0 ~p := #in~p;~q := #in~q; 138416#L20 assume !(~p <= 0); 138415#L21 assume !(~q <= 0); 138414#L22 assume !(~q > ~p); 138411#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138412#$Ultimate##0 ~p := #in~p;~q := #in~q; 138418#L20 assume ~p <= 0;#res := 1; 138417#partsFINAL assume true; 138410#partsEXIT >#64#return; 138407#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138408#$Ultimate##0 ~p := #in~p;~q := #in~q; 138424#L20 assume !(~p <= 0); 138423#L21 assume ~q <= 0;#res := 0; 138422#partsFINAL assume true; 138406#partsEXIT >#66#return; 138404#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138400#partsFINAL assume true; 138388#partsEXIT >#62#return; 138386#L22-2 #res := #t~ret0;havoc #t~ret0; 138382#partsFINAL assume true; 138369#partsEXIT >#64#return; 138359#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138365#$Ultimate##0 ~p := #in~p;~q := #in~q; 138478#L20 assume !(~p <= 0); 138475#L21 assume !(~q <= 0); 138470#L22 assume !(~q > ~p); 138289#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138466#$Ultimate##0 ~p := #in~p;~q := #in~q; 138696#L20 assume !(~p <= 0); 138695#L21 assume !(~q <= 0); 138686#L22 assume !(~q > ~p); 138281#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138287#$Ultimate##0 ~p := #in~p;~q := #in~q; 138286#L20 assume !(~p <= 0); 138284#L21 assume !(~q <= 0); 138282#L22 assume !(~q > ~p); 138276#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138277#$Ultimate##0 ~p := #in~p;~q := #in~q; 138283#L20 assume ~p <= 0;#res := 1; 138279#partsFINAL assume true; 138274#partsEXIT >#64#return; 138270#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138273#$Ultimate##0 ~p := #in~p;~q := #in~q; 138293#L20 assume !(~p <= 0); 138291#L21 assume ~q <= 0;#res := 0; 138288#partsFINAL assume true; 138269#partsEXIT >#66#return; 138272#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138977#partsFINAL assume true; 138681#partsEXIT >#64#return; 138673#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138674#$Ultimate##0 ~p := #in~p;~q := #in~q; 138691#L20 assume !(~p <= 0); 138687#L21 assume ~q <= 0;#res := 0; 138680#partsFINAL assume true; 138671#partsEXIT >#66#return; 138648#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138646#partsFINAL assume true; 138465#partsEXIT >#64#return; 138379#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138380#$Ultimate##0 ~p := #in~p;~q := #in~q; 138421#L20 assume !(~p <= 0); 138420#L21 assume ~q <= 0;#res := 0; 138419#partsFINAL assume true; 138378#partsEXIT >#66#return; 138376#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138368#partsFINAL assume true; 138357#partsEXIT >#66#return; 138364#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138509#partsFINAL assume true; 138329#partsEXIT >#68#return; 138328#L36-1 havoc main_#t~ret8#1; 138327#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138325#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138228#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138323#$Ultimate##0 ~p := #in~p;~q := #in~q; 138503#L20 assume !(~p <= 0); 138502#L21 assume !(~q <= 0); 138492#L22 assume !(~q > ~p); 138221#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138224#$Ultimate##0 ~p := #in~p;~q := #in~q; 138232#L20 assume ~p <= 0;#res := 1; 138227#partsFINAL assume true; 138218#partsEXIT >#64#return; 138223#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138508#$Ultimate##0 ~p := #in~p;~q := #in~q; 138520#L20 assume !(~p <= 0); 138518#L21 assume !(~q <= 0); 138516#L22 assume !(~q > ~p); 138513#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138514#$Ultimate##0 ~p := #in~p;~q := #in~q; 138531#L20 assume !(~p <= 0); 138530#L21 assume !(~q <= 0); 138529#L22 assume ~q > ~p; 138526#L22-1 call #t~ret0 := parts(~p, ~p);< 138527#$Ultimate##0 ~p := #in~p;~q := #in~q; 138545#L20 assume !(~p <= 0); 138544#L21 assume !(~q <= 0); 138543#L22 assume !(~q > ~p); 138540#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138541#$Ultimate##0 ~p := #in~p;~q := #in~q; 138547#L20 assume ~p <= 0;#res := 1; 138546#partsFINAL assume true; 138539#partsEXIT >#64#return; 138536#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138537#$Ultimate##0 ~p := #in~p;~q := #in~q; 138550#L20 assume !(~p <= 0); 138549#L21 assume ~q <= 0;#res := 0; 138548#partsFINAL assume true; 138535#partsEXIT >#66#return; 138533#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138532#partsFINAL assume true; 138525#partsEXIT >#62#return; 138523#L22-2 #res := #t~ret0;havoc #t~ret0; 138521#partsFINAL assume true; 138512#partsEXIT >#64#return; 138361#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138365#$Ultimate##0 ~p := #in~p;~q := #in~q; 138478#L20 assume !(~p <= 0); 138475#L21 assume !(~q <= 0); 138470#L22 assume !(~q > ~p); 138289#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138466#$Ultimate##0 ~p := #in~p;~q := #in~q; 138696#L20 assume !(~p <= 0); 138695#L21 assume !(~q <= 0); 138686#L22 assume !(~q > ~p); 138281#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138287#$Ultimate##0 ~p := #in~p;~q := #in~q; 138286#L20 assume !(~p <= 0); 138284#L21 assume !(~q <= 0); 138282#L22 assume !(~q > ~p); 138276#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138277#$Ultimate##0 ~p := #in~p;~q := #in~q; 138283#L20 assume ~p <= 0;#res := 1; 138279#partsFINAL assume true; 138274#partsEXIT >#64#return; 138270#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138273#$Ultimate##0 ~p := #in~p;~q := #in~q; 138293#L20 assume !(~p <= 0); 138291#L21 assume ~q <= 0;#res := 0; 138288#partsFINAL assume true; 138269#partsEXIT >#66#return; 138272#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138977#partsFINAL assume true; 138681#partsEXIT >#64#return; 138673#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138674#$Ultimate##0 ~p := #in~p;~q := #in~q; 138691#L20 assume !(~p <= 0); 138687#L21 assume ~q <= 0;#res := 0; 138680#partsFINAL assume true; 138671#partsEXIT >#66#return; 138648#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138646#partsFINAL assume true; 138465#partsEXIT >#64#return; 138379#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138380#$Ultimate##0 ~p := #in~p;~q := #in~q; 138421#L20 assume !(~p <= 0); 138420#L21 assume ~q <= 0;#res := 0; 138419#partsFINAL assume true; 138378#partsEXIT >#66#return; 138376#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138368#partsFINAL assume true; 138357#partsEXIT >#66#return; 138362#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138510#partsFINAL assume true; 138506#partsEXIT >#66#return; 138507#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138511#partsFINAL assume true; 138321#partsEXIT >#68#return; 138320#L36-1 havoc main_#t~ret8#1; 138183#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 138181#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 138027#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 138029#$Ultimate##0 ~p := #in~p;~q := #in~q; 138278#L20 assume !(~p <= 0); 138200#L21 assume !(~q <= 0); 138199#L22 assume ~q > ~p; 138049#L22-1 call #t~ret0 := parts(~p, ~p);< 138076#$Ultimate##0 ~p := #in~p;~q := #in~q; 138073#L20 assume !(~p <= 0); 138070#L21 assume !(~q <= 0); 138067#L22 assume !(~q > ~p); 138064#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138065#$Ultimate##0 ~p := #in~p;~q := #in~q; 138069#L20 assume ~p <= 0;#res := 1; 138066#partsFINAL assume true; 138063#partsEXIT >#64#return; 138048#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138051#$Ultimate##0 ~p := #in~p;~q := #in~q; 138129#L20 assume !(~p <= 0); 138116#L21 assume !(~q <= 0); 138105#L22 assume !(~q > ~p); 138102#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138103#$Ultimate##0 ~p := #in~p;~q := #in~q; 138165#L20 assume !(~p <= 0); 138164#L21 assume !(~q <= 0); 138163#L22 assume ~q > ~p; 138126#L22-1 call #t~ret0 := parts(~p, ~p);< 138127#$Ultimate##0 ~p := #in~p;~q := #in~q; 138162#L20 assume !(~p <= 0); 138161#L21 assume !(~q <= 0); 138158#L22 assume !(~q > ~p); 138153#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138154#$Ultimate##0 ~p := #in~p;~q := #in~q; 138160#L20 assume ~p <= 0;#res := 1; 138157#partsFINAL assume true; 138152#partsEXIT >#64#return; 138148#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138149#$Ultimate##0 ~p := #in~p;~q := #in~q; 138159#L20 assume !(~p <= 0); 138156#L21 assume ~q <= 0;#res := 0; 138151#partsFINAL assume true; 138147#partsEXIT >#66#return; 138145#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138139#partsFINAL assume true; 138125#partsEXIT >#62#return; 138115#L22-2 #res := #t~ret0;havoc #t~ret0; 138114#partsFINAL assume true; 138101#partsEXIT >#64#return; 138093#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138096#$Ultimate##0 ~p := #in~p;~q := #in~q; 138155#L20 assume !(~p <= 0); 138150#L21 assume !(~q <= 0); 138146#L22 assume !(~q > ~p); 138141#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138142#$Ultimate##0 ~p := #in~p;~q := #in~q; 138847#L20 assume !(~p <= 0); 138845#L21 assume !(~q <= 0); 138844#L22 assume !(~q > ~p); 137948#L23 call #t~ret1 := parts(~p - ~q, ~q);< 138137#$Ultimate##0 ~p := #in~p;~q := #in~q; 138135#L20 assume !(~p <= 0); 138133#L21 assume !(~q <= 0); 138131#L22 assume !(~q > ~p); 137967#L23 call #t~ret1 := parts(~p - ~q, ~q);< 137968#$Ultimate##0 ~p := #in~p;~q := #in~q; 138144#L20 assume ~p <= 0;#res := 1; 138143#partsFINAL assume true; 138123#partsEXIT >#64#return; 138119#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138121#$Ultimate##0 ~p := #in~p;~q := #in~q; 138138#L20 assume !(~p <= 0); 138136#L21 assume ~q <= 0;#res := 0; 138132#partsFINAL assume true; 138118#partsEXIT >#66#return; 137995#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 137996#partsFINAL assume true; 137947#partsEXIT >#64#return; 137950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 137957#$Ultimate##0 ~p := #in~p;~q := #in~q; 137990#L20 assume !(~p <= 0); 137986#L21 assume ~q <= 0;#res := 0; 137987#partsFINAL assume true; 138771#partsEXIT >#66#return; 138701#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138694#partsFINAL assume true; 138140#partsEXIT >#64#return; 138109#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 138110#$Ultimate##0 ~p := #in~p;~q := #in~q; 138166#L20 assume !(~p <= 0); 138130#L21 assume ~q <= 0;#res := 0; 138117#partsFINAL assume true; 138108#partsEXIT >#66#return; 138107#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138098#partsFINAL assume true; 138092#partsEXIT >#66#return; 138094#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138196#partsFINAL assume true; 138182#partsEXIT >#66#return; 138180#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 138179#partsFINAL assume true; 138177#partsEXIT >#62#return; 138178#L22-2 #res := #t~ret0;havoc #t~ret0; 138226#partsFINAL assume true; 138026#partsEXIT >#68#return; 138025#L36-1 [2023-02-15 14:15:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 958235364, now seen corresponding path program 12 times [2023-02-15 14:15:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002409108] [2023-02-15 14:15:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 14:15:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 14:15:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 14:15:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 14:15:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-02-15 14:15:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-02-15 14:15:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-02-15 14:15:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-02-15 14:15:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-02-15 14:15:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-02-15 14:15:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-02-15 14:15:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 572 proven. 13 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2023-02-15 14:15:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002409108] [2023-02-15 14:15:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002409108] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459391541] [2023-02-15 14:15:40,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 14:15:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:40,173 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2023-02-15 14:15:40,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-15 14:15:40,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:40,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:15:40,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 570 proven. 13 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2023-02-15 14:15:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 570 proven. 15 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2023-02-15 14:15:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459391541] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:40,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2023-02-15 14:15:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276960116] [2023-02-15 14:15:40,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:40,722 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:15:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash -884064415, now seen corresponding path program 9 times [2023-02-15 14:15:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:40,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185897446] [2023-02-15 14:15:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 14:15:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-15 14:15:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-02-15 14:15:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-02-15 14:15:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 195 proven. 1319 refuted. 0 times theorem prover too weak. 5434 trivial. 0 not checked. [2023-02-15 14:15:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185897446] [2023-02-15 14:15:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185897446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671969820] [2023-02-15 14:15:41,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:15:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:41,306 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:41,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2023-02-15 14:15:41,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-15 14:15:41,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:41,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 14:15:41,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 245 proven. 1045 refuted. 0 times theorem prover too weak. 5658 trivial. 0 not checked. [2023-02-15 14:15:41,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 243 proven. 1049 refuted. 0 times theorem prover too weak. 5656 trivial. 0 not checked. [2023-02-15 14:15:42,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671969820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:42,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:42,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 41 [2023-02-15 14:15:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887672678] [2023-02-15 14:15:42,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:42,557 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:42,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 14:15:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-15 14:15:42,558 INFO L87 Difference]: Start difference. First operand 1503 states and 1656 transitions. cyclomatic complexity: 172 Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 10 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2023-02-15 14:15:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:42,765 INFO L93 Difference]: Finished difference Result 1441 states and 1565 transitions. [2023-02-15 14:15:42,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1441 states and 1565 transitions. [2023-02-15 14:15:42,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:42,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1441 states to 1371 states and 1491 transitions. [2023-02-15 14:15:42,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2023-02-15 14:15:42,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2023-02-15 14:15:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1371 states and 1491 transitions. [2023-02-15 14:15:42,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:15:42,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1371 states and 1491 transitions. [2023-02-15 14:15:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states and 1491 transitions. [2023-02-15 14:15:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1357. [2023-02-15 14:15:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 967 states have (on average 1.0289555325749742) internal successors, (995), 977 states have internal predecessors, (995), 218 states have call successors, (229), 168 states have call predecessors, (229), 172 states have return successors, (252), 211 states have call predecessors, (252), 218 states have call successors, (252) [2023-02-15 14:15:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1476 transitions. [2023-02-15 14:15:42,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1357 states and 1476 transitions. [2023-02-15 14:15:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 14:15:42,784 INFO L428 stractBuchiCegarLoop]: Abstraction has 1357 states and 1476 transitions. [2023-02-15 14:15:42,785 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2023-02-15 14:15:42,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1357 states and 1476 transitions. [2023-02-15 14:15:42,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-02-15 14:15:42,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:15:42,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:15:42,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2023-02-15 14:15:42,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2023-02-15 14:15:42,788 INFO L748 eck$LassoCheckResult]: Stem: 146344#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 146312#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; 146313#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 146306#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; 146307#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 146358#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 147071#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 147072#$Ultimate##0 ~p := #in~p;~q := #in~q; 147079#L20 assume ~p <= 0;#res := 1; 147075#partsFINAL assume true; 147070#partsEXIT >#68#return; 147069#L36-1 havoc main_#t~ret8#1; 147067#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 147065#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 147062#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 147063#$Ultimate##0 ~p := #in~p;~q := #in~q; 147097#L20 assume ~p <= 0;#res := 1; 147096#partsFINAL assume true; 147061#partsEXIT >#68#return; 147056#L36-1 havoc main_#t~ret8#1; 147047#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 147044#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 147029#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 147009#$Ultimate##0 ~p := #in~p;~q := #in~q; 147036#L20 assume ~p <= 0;#res := 1; 147032#partsFINAL assume true; 147028#partsEXIT >#68#return; 147027#L36-1 havoc main_#t~ret8#1; 147025#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 147019#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 147008#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 147010#$Ultimate##0 ~p := #in~p;~q := #in~q; 147016#L20 assume ~p <= 0;#res := 1; 147014#partsFINAL assume true; 147007#partsEXIT >#68#return; 147002#L36-1 havoc main_#t~ret8#1; 147000#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146998#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 146991#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 146987#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 146985#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146912#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146913#$Ultimate##0 ~p := #in~p;~q := #in~q; 146930#L20 assume !(~p <= 0); 146928#L21 assume ~q <= 0;#res := 0; 146927#partsFINAL assume true; 146911#partsEXIT >#68#return; 146909#L36-1 havoc main_#t~ret8#1; 146905#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146903#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146900#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146901#$Ultimate##0 ~p := #in~p;~q := #in~q; 147017#L20 assume !(~p <= 0); 147015#L21 assume !(~q <= 0); 147012#L22 assume !(~q > ~p); 146995#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146996#$Ultimate##0 ~p := #in~p;~q := #in~q; 147020#L20 assume ~p <= 0;#res := 1; 147011#partsFINAL assume true; 146994#partsEXIT >#64#return; 146989#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146990#$Ultimate##0 ~p := #in~p;~q := #in~q; 147013#L20 assume !(~p <= 0); 146997#L21 assume ~q <= 0;#res := 0; 146992#partsFINAL assume true; 146988#partsEXIT >#66#return; 146986#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146984#partsFINAL assume true; 146899#partsEXIT >#68#return; 146898#L36-1 havoc main_#t~ret8#1; 146897#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146896#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146894#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146547#$Ultimate##0 ~p := #in~p;~q := #in~q; 147224#L20 assume !(~p <= 0); 147222#L21 assume !(~q <= 0); 147219#L22 assume ~q > ~p; 146907#L22-1 call #t~ret0 := parts(~p, ~p);< 146908#$Ultimate##0 ~p := #in~p;~q := #in~q; 147225#L20 assume !(~p <= 0); 147223#L21 assume !(~q <= 0); 147220#L22 assume !(~q > ~p); 146936#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146937#$Ultimate##0 ~p := #in~p;~q := #in~q; 147221#L20 assume ~p <= 0;#res := 1; 147218#partsFINAL assume true; 146935#partsEXIT >#64#return; 146933#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146934#$Ultimate##0 ~p := #in~p;~q := #in~q; 146954#L20 assume !(~p <= 0); 146952#L21 assume ~q <= 0;#res := 0; 146947#partsFINAL assume true; 146932#partsEXIT >#66#return; 146931#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146929#partsFINAL assume true; 146906#partsEXIT >#62#return; 146904#L22-2 #res := #t~ret0;havoc #t~ret0; 146902#partsFINAL assume true; 146893#partsEXIT >#68#return; 146891#L36-1 havoc main_#t~ret8#1; 146889#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146885#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146546#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146548#$Ultimate##0 ~p := #in~p;~q := #in~q; 146567#L20 assume !(~p <= 0); 146565#L21 assume !(~q <= 0); 146560#L22 assume ~q > ~p; 146557#L22-1 call #t~ret0 := parts(~p, ~p);< 146558#$Ultimate##0 ~p := #in~p;~q := #in~q; 146818#L20 assume !(~p <= 0); 146816#L21 assume !(~q <= 0); 146815#L22 assume !(~q > ~p); 146813#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146814#$Ultimate##0 ~p := #in~p;~q := #in~q; 146819#L20 assume ~p <= 0;#res := 1; 146817#partsFINAL assume true; 146812#partsEXIT >#64#return; 146810#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146811#$Ultimate##0 ~p := #in~p;~q := #in~q; 146823#L20 assume !(~p <= 0); 146821#L21 assume ~q <= 0;#res := 0; 146820#partsFINAL assume true; 146809#partsEXIT >#66#return; 146807#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146805#partsFINAL assume true; 146556#partsEXIT >#62#return; 146554#L22-2 #res := #t~ret0;havoc #t~ret0; 146552#partsFINAL assume true; 146545#partsEXIT >#68#return; 146543#L36-1 havoc main_#t~ret8#1; 146542#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146541#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 146540#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 146538#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 146536#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146532#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146534#$Ultimate##0 ~p := #in~p;~q := #in~q; 146808#L20 assume !(~p <= 0); 146806#L21 assume ~q <= 0;#res := 0; 146544#partsFINAL assume true; 146530#partsEXIT >#68#return; 146526#L36-1 havoc main_#t~ret8#1; 146522#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146520#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146515#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146518#$Ultimate##0 ~p := #in~p;~q := #in~q; 146539#L20 assume !(~p <= 0); 146537#L21 assume !(~q <= 0); 146535#L22 assume !(~q > ~p); 146528#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146529#$Ultimate##0 ~p := #in~p;~q := #in~q; 146834#L20 assume !(~p <= 0); 146832#L21 assume !(~q <= 0); 146831#L22 assume !(~q > ~p); 146829#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146830#$Ultimate##0 ~p := #in~p;~q := #in~q; 146835#L20 assume ~p <= 0;#res := 1; 146833#partsFINAL assume true; 146828#partsEXIT >#64#return; 146826#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146827#$Ultimate##0 ~p := #in~p;~q := #in~q; 146838#L20 assume !(~p <= 0); 146837#L21 assume ~q <= 0;#res := 0; 146836#partsFINAL assume true; 146825#partsEXIT >#66#return; 146824#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146822#partsFINAL assume true; 146527#partsEXIT >#64#return; 146524#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146525#$Ultimate##0 ~p := #in~p;~q := #in~q; 146845#L20 assume !(~p <= 0); 146843#L21 assume ~q <= 0;#res := 0; 146841#partsFINAL assume true; 146523#partsEXIT >#66#return; 146521#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146519#partsFINAL assume true; 146514#partsEXIT >#68#return; 146517#L36-1 havoc main_#t~ret8#1; 146850#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146848#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146495#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146498#$Ultimate##0 ~p := #in~p;~q := #in~q; 146622#L20 assume !(~p <= 0); 146620#L21 assume !(~q <= 0); 146618#L22 assume !(~q > ~p); 146590#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146592#$Ultimate##0 ~p := #in~p;~q := #in~q; 146725#L20 assume ~p <= 0;#res := 1; 146714#partsFINAL assume true; 146587#partsEXIT >#64#return; 146591#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146616#$Ultimate##0 ~p := #in~p;~q := #in~q; 146636#L20 assume !(~p <= 0); 146634#L21 assume !(~q <= 0); 146633#L22 assume !(~q > ~p); 146630#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146632#$Ultimate##0 ~p := #in~p;~q := #in~q; 146659#L20 assume !(~p <= 0); 146657#L21 assume !(~q <= 0); 146655#L22 assume !(~q > ~p); 146648#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146650#$Ultimate##0 ~p := #in~p;~q := #in~q; 146676#L20 assume ~p <= 0;#res := 1; 146669#partsFINAL assume true; 146647#partsEXIT >#64#return; 146644#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146646#$Ultimate##0 ~p := #in~p;~q := #in~q; 146683#L20 assume !(~p <= 0); 146681#L21 assume ~q <= 0;#res := 0; 146680#partsFINAL assume true; 146642#partsEXIT >#66#return; 146640#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146635#partsFINAL assume true; 146629#partsEXIT >#64#return; 146625#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146628#$Ultimate##0 ~p := #in~p;~q := #in~q; 146685#L20 assume !(~p <= 0); 146684#L21 assume ~q <= 0;#res := 0; 146682#partsFINAL assume true; 146624#partsEXIT >#66#return; 146623#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146621#partsFINAL assume true; 146615#partsEXIT >#66#return; 146613#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146503#partsFINAL assume true; 146493#partsEXIT >#68#return; 146491#L36-1 havoc main_#t~ret8#1; 146489#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146488#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146350#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146444#$Ultimate##0 ~p := #in~p;~q := #in~q; 146440#L20 assume !(~p <= 0); 146436#L21 assume !(~q <= 0); 146435#L22 assume ~q > ~p; 146374#L22-1 call #t~ret0 := parts(~p, ~p);< 146433#$Ultimate##0 ~p := #in~p;~q := #in~q; 146432#L20 assume !(~p <= 0); 146431#L21 assume !(~q <= 0); 146430#L22 assume !(~q > ~p); 146386#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146388#$Ultimate##0 ~p := #in~p;~q := #in~q; 146390#L20 assume ~p <= 0;#res := 1; 146389#partsFINAL assume true; 146385#partsEXIT >#64#return; 146381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146422#$Ultimate##0 ~p := #in~p;~q := #in~q; 146420#L20 assume !(~p <= 0); 146418#L21 assume !(~q <= 0); 146412#L22 assume !(~q > ~p); 146403#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146404#$Ultimate##0 ~p := #in~p;~q := #in~q; 146448#L20 assume !(~p <= 0); 146446#L21 assume !(~q <= 0); 146445#L22 assume !(~q > ~p); 146333#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146315#$Ultimate##0 ~p := #in~p;~q := #in~q; 146334#L20 assume ~p <= 0;#res := 1; 146357#partsFINAL assume true; 146419#partsEXIT >#64#return; 146416#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146417#$Ultimate##0 ~p := #in~p;~q := #in~q; 146476#L20 assume !(~p <= 0); 146473#L21 assume ~q <= 0;#res := 0; 146426#partsFINAL assume true; 146414#partsEXIT >#66#return; 146411#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146410#partsFINAL assume true; 146402#partsEXIT >#64#return; 146394#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146398#$Ultimate##0 ~p := #in~p;~q := #in~q; 146434#L20 assume !(~p <= 0); 146408#L21 assume ~q <= 0;#res := 0; 146400#partsFINAL assume true; 146393#partsEXIT >#66#return; 146395#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146739#partsFINAL assume true; 146584#partsEXIT >#66#return; 146583#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146582#partsFINAL assume true; 146373#partsEXIT >#62#return; 146375#L22-2 #res := #t~ret0;havoc #t~ret0; 146500#partsFINAL assume true; 146363#partsEXIT >#68#return; 146362#L36-1 [2023-02-15 14:15:42,789 INFO L750 eck$LassoCheckResult]: Loop: 146362#L36-1 havoc main_#t~ret8#1; 146361#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146360#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 146318#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 146319#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 146324#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146325#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146368#$Ultimate##0 ~p := #in~p;~q := #in~q; 146371#L20 assume !(~p <= 0); 146370#L21 assume ~q <= 0;#res := 0; 146369#partsFINAL assume true; 146367#partsEXIT >#68#return; 146354#L36-1 havoc main_#t~ret8#1; 146345#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146346#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146308#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146309#$Ultimate##0 ~p := #in~p;~q := #in~q; 146895#L20 assume !(~p <= 0); 146892#L21 assume !(~q <= 0); 146890#L22 assume !(~q > ~p); 146887#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146888#$Ultimate##0 ~p := #in~p;~q := #in~q; 146956#L20 assume !(~p <= 0); 146955#L21 assume !(~q <= 0); 146953#L22 assume !(~q > ~p); 146950#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146951#$Ultimate##0 ~p := #in~p;~q := #in~q; 146964#L20 assume !(~p <= 0); 146960#L21 assume !(~q <= 0); 146958#L22 assume !(~q > ~p); 146949#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146951#$Ultimate##0 ~p := #in~p;~q := #in~q; 146964#L20 assume !(~p <= 0); 146960#L21 assume !(~q <= 0); 146958#L22 assume !(~q > ~p); 146959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146973#$Ultimate##0 ~p := #in~p;~q := #in~q; 146977#L20 assume ~p <= 0;#res := 1; 146976#partsFINAL assume true; 146972#partsEXIT >#64#return; 146969#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146970#$Ultimate##0 ~p := #in~p;~q := #in~q; 146981#L20 assume !(~p <= 0); 146979#L21 assume ~q <= 0;#res := 0; 146978#partsFINAL assume true; 146968#partsEXIT >#66#return; 146967#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146966#partsFINAL assume true; 146965#partsEXIT >#64#return; 146962#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146963#$Ultimate##0 ~p := #in~p;~q := #in~q; 146975#L20 assume !(~p <= 0); 146974#L21 assume ~q <= 0;#res := 0; 146971#partsFINAL assume true; 146961#partsEXIT >#66#return; 146945#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146957#partsFINAL assume true; 146948#partsEXIT >#64#return; 146944#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146946#$Ultimate##0 ~p := #in~p;~q := #in~q; 146983#L20 assume !(~p <= 0); 146982#L21 assume ~q <= 0;#res := 0; 146980#partsFINAL assume true; 146942#partsEXIT >#66#return; 146941#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146940#partsFINAL assume true; 146886#partsEXIT >#64#return; 146883#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146884#$Ultimate##0 ~p := #in~p;~q := #in~q; 146920#L20 assume !(~p <= 0); 146919#L21 assume ~q <= 0;#res := 0; 146918#partsFINAL assume true; 146882#partsEXIT >#66#return; 146881#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146880#partsFINAL assume true; 146878#partsEXIT >#68#return; 146876#L36-1 havoc main_#t~ret8#1; 146875#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146874#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146871#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146872#$Ultimate##0 ~p := #in~p;~q := #in~q; 146926#L20 assume !(~p <= 0); 146925#L21 assume !(~q <= 0); 146921#L22 assume !(~q > ~p); 146916#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146917#$Ultimate##0 ~p := #in~p;~q := #in~q; 147122#L20 assume !(~p <= 0); 147118#L21 assume !(~q <= 0); 147114#L22 assume ~q > ~p; 147108#L22-1 call #t~ret0 := parts(~p, ~p);< 147109#$Ultimate##0 ~p := #in~p;~q := #in~q; 147155#L20 assume !(~p <= 0); 147144#L21 assume !(~q <= 0); 147140#L22 assume !(~q > ~p); 147132#L23 call #t~ret1 := parts(~p - ~q, ~q);< 147133#$Ultimate##0 ~p := #in~p;~q := #in~q; 147136#L20 assume ~p <= 0;#res := 1; 147135#partsFINAL assume true; 147131#partsEXIT >#64#return; 147128#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 147129#$Ultimate##0 ~p := #in~p;~q := #in~q; 147139#L20 assume !(~p <= 0); 147138#L21 assume ~q <= 0;#res := 0; 147137#partsFINAL assume true; 147127#partsEXIT >#66#return; 147126#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 147125#partsFINAL assume true; 147107#partsEXIT >#62#return; 147101#L22-2 #res := #t~ret0;havoc #t~ret0; 147099#partsFINAL assume true; 146915#partsEXIT >#64#return; 146597#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146602#$Ultimate##0 ~p := #in~p;~q := #in~q; 146696#L20 assume !(~p <= 0); 146694#L21 assume !(~q <= 0); 146693#L22 assume !(~q > ~p); 146691#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146692#$Ultimate##0 ~p := #in~p;~q := #in~q; 146706#L20 assume !(~p <= 0); 146704#L21 assume !(~q <= 0); 146703#L22 assume !(~q > ~p); 146671#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146677#$Ultimate##0 ~p := #in~p;~q := #in~q; 146675#L20 assume !(~p <= 0); 146673#L21 assume !(~q <= 0); 146672#L22 assume !(~q > ~p); 146649#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146650#$Ultimate##0 ~p := #in~p;~q := #in~q; 146676#L20 assume ~p <= 0;#res := 1; 146669#partsFINAL assume true; 146647#partsEXIT >#64#return; 146643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146646#$Ultimate##0 ~p := #in~p;~q := #in~q; 146683#L20 assume !(~p <= 0); 146681#L21 assume ~q <= 0;#res := 0; 146680#partsFINAL assume true; 146642#partsEXIT >#66#return; 146645#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146705#partsFINAL assume true; 146702#partsEXIT >#64#return; 146700#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146701#$Ultimate##0 ~p := #in~p;~q := #in~q; 146711#L20 assume !(~p <= 0); 146709#L21 assume ~q <= 0;#res := 0; 146707#partsFINAL assume true; 146698#partsEXIT >#66#return; 146697#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146695#partsFINAL assume true; 146690#partsEXIT >#64#return; 146688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146689#$Ultimate##0 ~p := #in~p;~q := #in~q; 146712#L20 assume !(~p <= 0); 146710#L21 assume ~q <= 0;#res := 0; 146708#partsFINAL assume true; 146687#partsEXIT >#66#return; 146686#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146610#partsFINAL assume true; 146594#partsEXIT >#66#return; 146599#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146873#partsFINAL assume true; 146870#partsEXIT >#68#return; 146869#L36-1 havoc main_#t~ret8#1; 146866#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146865#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146586#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146864#$Ultimate##0 ~p := #in~p;~q := #in~q; 146924#L20 assume !(~p <= 0); 146923#L21 assume !(~q <= 0); 146922#L22 assume !(~q > ~p); 146589#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146592#$Ultimate##0 ~p := #in~p;~q := #in~q; 146725#L20 assume ~p <= 0;#res := 1; 146714#partsFINAL assume true; 146587#partsEXIT >#64#return; 146579#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146581#$Ultimate##0 ~p := #in~p;~q := #in~q; 147211#L20 assume !(~p <= 0); 147210#L21 assume !(~q <= 0); 147209#L22 assume !(~q > ~p); 146605#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146606#$Ultimate##0 ~p := #in~p;~q := #in~q; 146723#L20 assume !(~p <= 0); 146721#L21 assume !(~q <= 0); 146719#L22 assume ~q > ~p; 146716#L22-1 call #t~ret0 := parts(~p, ~p);< 146717#$Ultimate##0 ~p := #in~p;~q := #in~q; 146736#L20 assume !(~p <= 0); 146734#L21 assume !(~q <= 0); 146733#L22 assume !(~q > ~p); 146731#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146732#$Ultimate##0 ~p := #in~p;~q := #in~q; 146737#L20 assume ~p <= 0;#res := 1; 146735#partsFINAL assume true; 146730#partsEXIT >#64#return; 146728#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146729#$Ultimate##0 ~p := #in~p;~q := #in~q; 146741#L20 assume !(~p <= 0); 146740#L21 assume ~q <= 0;#res := 0; 146738#partsFINAL assume true; 146727#partsEXIT >#66#return; 146726#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146724#partsFINAL assume true; 146715#partsEXIT >#62#return; 146713#L22-2 #res := #t~ret0;havoc #t~ret0; 146607#partsFINAL assume true; 146603#partsEXIT >#64#return; 146596#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146602#$Ultimate##0 ~p := #in~p;~q := #in~q; 146696#L20 assume !(~p <= 0); 146694#L21 assume !(~q <= 0); 146693#L22 assume !(~q > ~p); 146691#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146692#$Ultimate##0 ~p := #in~p;~q := #in~q; 146706#L20 assume !(~p <= 0); 146704#L21 assume !(~q <= 0); 146703#L22 assume !(~q > ~p); 146671#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146677#$Ultimate##0 ~p := #in~p;~q := #in~q; 146675#L20 assume !(~p <= 0); 146673#L21 assume !(~q <= 0); 146672#L22 assume !(~q > ~p); 146649#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146650#$Ultimate##0 ~p := #in~p;~q := #in~q; 146676#L20 assume ~p <= 0;#res := 1; 146669#partsFINAL assume true; 146647#partsEXIT >#64#return; 146643#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146646#$Ultimate##0 ~p := #in~p;~q := #in~q; 146683#L20 assume !(~p <= 0); 146681#L21 assume ~q <= 0;#res := 0; 146680#partsFINAL assume true; 146642#partsEXIT >#66#return; 146645#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146705#partsFINAL assume true; 146702#partsEXIT >#64#return; 146700#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146701#$Ultimate##0 ~p := #in~p;~q := #in~q; 146711#L20 assume !(~p <= 0); 146709#L21 assume ~q <= 0;#res := 0; 146707#partsFINAL assume true; 146698#partsEXIT >#66#return; 146697#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146695#partsFINAL assume true; 146690#partsEXIT >#64#return; 146688#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146689#$Ultimate##0 ~p := #in~p;~q := #in~q; 146712#L20 assume !(~p <= 0); 146710#L21 assume ~q <= 0;#res := 0; 146708#partsFINAL assume true; 146687#partsEXIT >#66#return; 146686#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146610#partsFINAL assume true; 146594#partsEXIT >#66#return; 146593#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146585#partsFINAL assume true; 146577#partsEXIT >#66#return; 146580#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146867#partsFINAL assume true; 146862#partsEXIT >#68#return; 146860#L36-1 havoc main_#t~ret8#1; 146857#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 146854#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 146364#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 146366#$Ultimate##0 ~p := #in~p;~q := #in~q; 146499#L20 assume !(~p <= 0); 146492#L21 assume !(~q <= 0); 146490#L22 assume ~q > ~p; 146377#L22-1 call #t~ret0 := parts(~p, ~p);< 146337#$Ultimate##0 ~p := #in~p;~q := #in~q; 146574#L20 assume !(~p <= 0); 146485#L21 assume !(~q <= 0); 146392#L22 assume !(~q > ~p); 146387#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146388#$Ultimate##0 ~p := #in~p;~q := #in~q; 146390#L20 assume ~p <= 0;#res := 1; 146389#partsFINAL assume true; 146385#partsEXIT >#64#return; 146382#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146383#$Ultimate##0 ~p := #in~p;~q := #in~q; 146429#L20 assume !(~p <= 0); 146428#L21 assume !(~q <= 0); 146427#L22 assume !(~q > ~p); 146406#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146407#$Ultimate##0 ~p := #in~p;~q := #in~q; 146475#L20 assume !(~p <= 0); 146472#L21 assume !(~q <= 0); 146470#L22 assume ~q > ~p; 146424#L22-1 call #t~ret0 := parts(~p, ~p);< 146425#$Ultimate##0 ~p := #in~p;~q := #in~q; 146464#L20 assume !(~p <= 0); 146463#L21 assume !(~q <= 0); 146462#L22 assume !(~q > ~p); 146459#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146460#$Ultimate##0 ~p := #in~p;~q := #in~q; 146466#L20 assume ~p <= 0;#res := 1; 146465#partsFINAL assume true; 146458#partsEXIT >#64#return; 146455#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146456#$Ultimate##0 ~p := #in~p;~q := #in~q; 146469#L20 assume !(~p <= 0); 146468#L21 assume ~q <= 0;#res := 0; 146467#partsFINAL assume true; 146454#partsEXIT >#66#return; 146452#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146451#partsFINAL assume true; 146423#partsEXIT >#62#return; 146421#L22-2 #res := #t~ret0;havoc #t~ret0; 146413#partsFINAL assume true; 146405#partsEXIT >#64#return; 146397#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146399#$Ultimate##0 ~p := #in~p;~q := #in~q; 146484#L20 assume !(~p <= 0); 146480#L21 assume !(~q <= 0); 146478#L22 assume !(~q > ~p); 146442#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146443#$Ultimate##0 ~p := #in~p;~q := #in~q; 146859#L20 assume !(~p <= 0); 146856#L21 assume !(~q <= 0); 146853#L22 assume !(~q > ~p); 146295#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146852#$Ultimate##0 ~p := #in~p;~q := #in~q; 146861#L20 assume !(~p <= 0); 146858#L21 assume !(~q <= 0); 146322#L22 assume !(~q > ~p); 146314#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146315#$Ultimate##0 ~p := #in~p;~q := #in~q; 146334#L20 assume ~p <= 0;#res := 1; 146357#partsFINAL assume true; 146419#partsEXIT >#64#return; 146415#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146417#$Ultimate##0 ~p := #in~p;~q := #in~q; 146476#L20 assume !(~p <= 0); 146473#L21 assume ~q <= 0;#res := 0; 146426#partsFINAL assume true; 146414#partsEXIT >#66#return; 146340#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146341#partsFINAL assume true; 146293#partsEXIT >#64#return; 146296#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146302#$Ultimate##0 ~p := #in~p;~q := #in~q; 146461#L20 assume !(~p <= 0); 146457#L21 assume ~q <= 0;#res := 0; 146453#partsFINAL assume true; 146450#partsEXIT >#66#return; 146449#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146447#partsFINAL assume true; 146441#partsEXIT >#64#return; 146438#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146439#$Ultimate##0 ~p := #in~p;~q := #in~q; 146477#L20 assume !(~p <= 0); 146474#L21 assume ~q <= 0;#res := 0; 146471#partsFINAL assume true; 146437#partsEXIT >#66#return; 146409#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146401#partsFINAL assume true; 146396#partsEXIT >#66#return; 146391#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146384#partsFINAL assume true; 146380#partsEXIT >#66#return; 146379#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 146376#partsFINAL assume true; 146378#partsEXIT >#62#return; 146487#L22-2 #res := #t~ret0;havoc #t~ret0; 146486#partsFINAL assume true; 146481#partsEXIT >#68#return; 146362#L36-1 [2023-02-15 14:15:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1541176218, now seen corresponding path program 13 times [2023-02-15 14:15:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213988956] [2023-02-15 14:15:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:42,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:15:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:15:42,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:15:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:15:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash -884064415, now seen corresponding path program 10 times [2023-02-15 14:15:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:15:42,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505964742] [2023-02-15 14:15:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:15:42,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:15:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 14:15:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-15 14:15:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-15 14:15:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-02-15 14:15:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-02-15 14:15:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-02-15 14:15:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 14:15:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-15 14:15:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 14:15:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 14:15:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 14:15:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:15:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 195 proven. 1319 refuted. 0 times theorem prover too weak. 5434 trivial. 0 not checked. [2023-02-15 14:15:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:15:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505964742] [2023-02-15 14:15:43,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505964742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:15:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239794874] [2023-02-15 14:15:43,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:15:43,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:15:43,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:15:43,421 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:15:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2023-02-15 14:15:43,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:15:43,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:15:43,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 14:15:43,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:15:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 3647 proven. 400 refuted. 0 times theorem prover too weak. 2901 trivial. 0 not checked. [2023-02-15 14:15:43,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:15:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 178 proven. 1354 refuted. 0 times theorem prover too weak. 5416 trivial. 0 not checked. [2023-02-15 14:15:44,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239794874] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:15:44,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:15:44,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 21] total 35 [2023-02-15 14:15:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784521864] [2023-02-15 14:15:44,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:15:44,603 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:15:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:15:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 14:15:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 14:15:44,604 INFO L87 Difference]: Start difference. First operand 1357 states and 1476 transitions. cyclomatic complexity: 136 Second operand has 35 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 26 states have call successors, (34), 2 states have call predecessors, (34), 8 states have return successors, (39), 16 states have call predecessors, (39), 26 states have call successors, (39) [2023-02-15 14:15:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:15:45,479 INFO L93 Difference]: Finished difference Result 1539 states and 1692 transitions. [2023-02-15 14:15:45,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1539 states and 1692 transitions. [2023-02-15 14:15:45,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:15:45,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1539 states to 0 states and 0 transitions. [2023-02-15 14:15:45,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-15 14:15:45,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-15 14:15:45,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-15 14:15:45,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:15:45,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:15:45,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:15:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 14:15:45,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:15:45,484 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2023-02-15 14:15:45,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-15 14:15:45,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:15:45,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-15 14:15:45,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:15:45 BoogieIcfgContainer [2023-02-15 14:15:45,489 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:15:45,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:15:45,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:15:45,490 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:15:45,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:37" (3/4) ... [2023-02-15 14:15:45,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 14:15:45,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:15:45,493 INFO L158 Benchmark]: Toolchain (without parser) took 68596.71ms. Allocated memory was 123.7MB in the beginning and 539.0MB in the end (delta: 415.2MB). Free memory was 81.4MB in the beginning and 254.8MB in the end (delta: -173.4MB). Peak memory consumption was 244.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:45,493 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:45,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.01ms. Allocated memory is still 123.7MB. Free memory was 81.4MB in the beginning and 71.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 14:15:45,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.06ms. Allocated memory is still 123.7MB. Free memory was 71.9MB in the beginning and 70.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:45,494 INFO L158 Benchmark]: Boogie Preprocessor took 21.57ms. Allocated memory is still 123.7MB. Free memory was 70.3MB in the beginning and 69.5MB in the end (delta: 862.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:15:45,494 INFO L158 Benchmark]: RCFGBuilder took 197.59ms. Allocated memory is still 123.7MB. Free memory was 69.5MB in the beginning and 59.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:45,494 INFO L158 Benchmark]: BuchiAutomizer took 68176.83ms. Allocated memory was 123.7MB in the beginning and 539.0MB in the end (delta: 415.2MB). Free memory was 59.9MB in the beginning and 254.8MB in the end (delta: -195.0MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. [2023-02-15 14:15:45,494 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 539.0MB. Free memory is still 254.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:15:45,495 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.14ms. Allocated memory is still 123.7MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.01ms. Allocated memory is still 123.7MB. Free memory was 81.4MB in the beginning and 71.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.06ms. Allocated memory is still 123.7MB. Free memory was 71.9MB in the beginning and 70.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.57ms. Allocated memory is still 123.7MB. Free memory was 70.3MB in the beginning and 69.5MB in the end (delta: 862.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 197.59ms. Allocated memory is still 123.7MB. Free memory was 69.5MB in the beginning and 59.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 68176.83ms. Allocated memory was 123.7MB in the beginning and 539.0MB in the end (delta: 415.2MB). Free memory was 59.9MB in the beginning and 254.8MB in the end (delta: -195.0MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 539.0MB. Free memory is still 254.8MB. 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 41 terminating modules (25 trivial, 11 deterministic, 5 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 p and consists of 11 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 12 locations. One deterministic module has affine ranking function 3 + -2 * p and consists of 14 locations. One deterministic module has affine ranking function 5 + -2 * p and consists of 17 locations. One nondeterministic module has affine ranking function -2 * q + 1 and consists of 8 locations. One nondeterministic module has affine ranking function -1 * q + x 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. 25 modules have a trivial ranking function, the largest among these consists of 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 68.1s and 28 iterations. TraceHistogramMax:51. Analysis of lassos took 47.8s. Construction of modules took 4.8s. Büchi inclusion checks took 14.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 38. Automata minimization 0.9s AutomataMinimizationTime, 40 MinimizatonAttempts, 4178 StatesRemovedByMinimization, 39 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [11, 0, 5, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6476/7666 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2929 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2856 mSDsluCounter, 5904 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4419 mSDsCounter, 2442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10894 IncrementalHoareTripleChecker+Invalid, 13336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2442 mSolverCounterUnsat, 1485 mSDtfsCounter, 10894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT2 conc0 concLT6 SILN0 SILU0 SILI2 SILT8 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp85 ukn100 mio100 lsp100 div113 bol100 ite100 ukn100 eq151 hnf100 smp91 dnf94 smp100 tf108 neg96 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 108ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 33 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 16 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 21.1s 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 14:15:45,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:45,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:45,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:46,129 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 14:15:46,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:46,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2023-02-15 14:15:46,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:46,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:47,356 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 14:15:47,557 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 14:15:47,758 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 14:15:47,957 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 14:15:48,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:48,958 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 14:15:49,158 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 14:15:49,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-15 14:15:49,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE