./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 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/Binomial.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 c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 03:07:39,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 03:07:39,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 03:07:40,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 03:07:40,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 03:07:40,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 03:07:40,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 03:07:40,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 03:07:40,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 03:07:40,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 03:07:40,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 03:07:40,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 03:07:40,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 03:07:40,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 03:07:40,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 03:07:40,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 03:07:40,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 03:07:40,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 03:07:40,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 03:07:40,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 03:07:40,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 03:07:40,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 03:07:40,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 03:07:40,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 03:07:40,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 03:07:40,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 03:07:40,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 03:07:40,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 03:07:40,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 03:07:40,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 03:07:40,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 03:07:40,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 03:07:40,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 03:07:40,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 03:07:40,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 03:07:40,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 03:07:40,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 03:07:40,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 03:07:40,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 03:07:40,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 03:07:40,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 03:07:40,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 03:07:40,080 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 03:07:40,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 03:07:40,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 03:07:40,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 03:07:40,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 03:07:40,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 03:07:40,085 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 03:07:40,085 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 03:07:40,085 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 03:07:40,085 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 03:07:40,086 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 03:07:40,086 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 03:07:40,086 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 03:07:40,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 03:07:40,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 03:07:40,088 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 03:07:40,088 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 03:07:40,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 03:07:40,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 03:07:40,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 03:07:40,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 03:07:40,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 03:07:40,090 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 03:07:40,090 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 -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2023-02-14 03:07:40,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 03:07:40,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 03:07:40,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 03:07:40,311 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 03:07:40,311 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 03:07:40,312 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-14 03:07:41,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 03:07:41,641 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 03:07:41,641 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2023-02-14 03:07:41,646 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b705d36/0e8fbd198695485489ddc6c7f55fcc46/FLAG8467dd205 [2023-02-14 03:07:41,665 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b705d36/0e8fbd198695485489ddc6c7f55fcc46 [2023-02-14 03:07:41,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 03:07:41,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 03:07:41,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 03:07:41,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 03:07:41,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 03:07:41,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd3ae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41, skipping insertion in model container [2023-02-14 03:07:41,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 03:07:41,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 03:07:41,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:07:41,836 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 03:07:41,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:07:41,857 INFO L208 MainTranslator]: Completed translation [2023-02-14 03:07:41,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41 WrapperNode [2023-02-14 03:07:41,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 03:07:41,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 03:07:41,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 03:07:41,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 03:07:41,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,887 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2023-02-14 03:07:41,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 03:07:41,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 03:07:41,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 03:07:41,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 03:07:41,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 03:07:41,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 03:07:41,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 03:07:41,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 03:07:41,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (1/1) ... [2023-02-14 03:07:41,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:41,972 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-14 03:07:41,985 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-14 03:07:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2023-02-14 03:07:42,013 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2023-02-14 03:07:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 03:07:42,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 03:07:42,053 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 03:07:42,055 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 03:07:42,196 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 03:07:42,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 03:07:42,202 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 03:07:42,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:07:42 BoogieIcfgContainer [2023-02-14 03:07:42,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 03:07:42,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 03:07:42,204 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 03:07:42,207 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 03:07:42,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:42,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 03:07:41" (1/3) ... [2023-02-14 03:07:42,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32f314b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:07:42, skipping insertion in model container [2023-02-14 03:07:42,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:42,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:41" (2/3) ... [2023-02-14 03:07:42,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32f314b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:07:42, skipping insertion in model container [2023-02-14 03:07:42,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:42,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:07:42" (3/3) ... [2023-02-14 03:07:42,210 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2023-02-14 03:07:42,246 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 03:07:42,246 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 03:07:42,246 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 03:07:42,247 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 03:07:42,247 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 03:07:42,247 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 03:07:42,247 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 03:07:42,247 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 03:07:42,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 03:07:42,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 03:07:42,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:42,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:42,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:42,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:42,268 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 03:07:42,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 03:07:42,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 03:07:42,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:42,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:42,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:42,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:42,278 INFO L748 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27#L38true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11#L41-3true [2023-02-14 03:07:42,278 INFO L750 eck$LassoCheckResult]: Loop: 11#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 12#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11#L41-3true [2023-02-14 03:07:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2023-02-14 03:07:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:42,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518268614] [2023-02-14 03:07:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2023-02-14 03:07:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:42,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958917393] [2023-02-14 03:07:42,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2023-02-14 03:07:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311344864] [2023-02-14 03:07:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:42,504 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-14 03:07:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:42,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311344864] [2023-02-14 03:07:42,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311344864] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:42,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:42,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 03:07:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52286291] [2023-02-14 03:07:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:42,576 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:42,577 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:42,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:42,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:42,577 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:42,578 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,578 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:42,578 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:42,578 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-14 03:07:42,578 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:42,578 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:42,589 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:42,603 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:42,663 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:42,664 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,668 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-14 03:07:42,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:42,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:42,682 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-14 03:07:42,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:42,689 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-14 03:07:42,696 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-14 03:07:42,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,698 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-14 03:07:42,700 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-14 03:07:42,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:42,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:42,767 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-14 03:07:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,769 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-14 03:07:42,771 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-14 03:07:42,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:42,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:42,911 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:42,916 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-14 03:07:42,916 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:42,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:42,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:42,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:42,917 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:42,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:42,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:42,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2023-02-14 03:07:42,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:42,917 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:42,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-14 03:07:42,925 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:42,953 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:42,956 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,959 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-14 03:07:42,961 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-14 03:07:42,962 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-14 03:07:42,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:43,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:43,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:43,013 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-14 03:07:43,031 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-14 03:07:43,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:43,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:43,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:43,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:43,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:43,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:43,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:43,054 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-14 03:07:43,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:43,063 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:07:43,063 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-02-14 03:07:43,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:43,112 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-14 03:07:43,113 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-14 03:07:43,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:43,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:07:43,117 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:43,117 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-14 03:07:43,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-14 03:07:43,123 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:07:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:43,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:07:43,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:43,158 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:43,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:43,201 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-14 03:07:43,225 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-14 03:07:43,226 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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-14 03:07:43,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). 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 73 states and 106 transitions. Complement of second has 11 states. [2023-02-14 03:07:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-14 03:07:43,297 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-14 03:07:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2023-02-14 03:07:43,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2023-02-14 03:07:43,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:43,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2023-02-14 03:07:43,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:43,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2023-02-14 03:07:43,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:43,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2023-02-14 03:07:43,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2023-02-14 03:07:43,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2023-02-14 03:07:43,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-02-14 03:07:43,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-14 03:07:43,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2023-02-14 03:07:43,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:43,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2023-02-14 03:07:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2023-02-14 03:07:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2023-02-14 03:07:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 03:07:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-02-14 03:07:43,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-02-14 03:07:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 03:07:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 03:07:43,350 INFO L87 Difference]: Start difference. First operand 30 states and 42 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-14 03:07:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:43,388 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-14 03:07:43,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2023-02-14 03:07:43,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:07:43,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2023-02-14 03:07:43,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-14 03:07:43,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-14 03:07:43,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2023-02-14 03:07:43,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:43,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-14 03:07:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2023-02-14 03:07:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-14 03:07:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 03:07:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-14 03:07:43,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-14 03:07:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 03:07:43,401 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-14 03:07:43,401 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 03:07:43,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2023-02-14 03:07:43,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:07:43,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:43,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:43,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:43,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:43,404 INFO L748 eck$LassoCheckResult]: Stem: 243#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 232#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 238#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 234#L41-3 [2023-02-14 03:07:43,404 INFO L750 eck$LassoCheckResult]: Loop: 234#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 240#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#74#return; 225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#76#return; 221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 219#$Ultimate##0 ~n := #in~n; 241#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#78#return; 227#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 233#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 239#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 242#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 237#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 234#L41-3 [2023-02-14 03:07:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2023-02-14 03:07:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531747052] [2023-02-14 03:07:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2023-02-14 03:07:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728295726] [2023-02-14 03:07:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:43,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758053200] [2023-02-14 03:07:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:43,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:43,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:43,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 03:07:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:43,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:07:43,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 03:07:43,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 03:07:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:43,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728295726] [2023-02-14 03:07:43,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:43,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758053200] [2023-02-14 03:07:43,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758053200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:43,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:43,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 03:07:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113874752] [2023-02-14 03:07:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:43,551 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 03:07:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 03:07:43,552 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 03:07:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:43,622 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-02-14 03:07:43,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2023-02-14 03:07:43,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-14 03:07:43,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2023-02-14 03:07:43,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-02-14 03:07:43,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-02-14 03:07:43,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2023-02-14 03:07:43,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:43,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-02-14 03:07:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2023-02-14 03:07:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2023-02-14 03:07:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-14 03:07:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2023-02-14 03:07:43,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-14 03:07:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 03:07:43,637 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2023-02-14 03:07:43,637 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 03:07:43,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2023-02-14 03:07:43,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:07:43,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:43,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:43,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:43,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:43,639 INFO L748 eck$LassoCheckResult]: Stem: 380#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 367#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 374#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 370#L41-3 [2023-02-14 03:07:43,639 INFO L750 eck$LassoCheckResult]: Loop: 370#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 376#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#74#return; 362#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#76#return; 358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#$Ultimate##0 ~n := #in~n; 378#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 377#factFINAL assume true; 381#factEXIT >#78#return; 368#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 369#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 375#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 379#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 373#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 370#L41-3 [2023-02-14 03:07:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2023-02-14 03:07:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279094290] [2023-02-14 03:07:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2023-02-14 03:07:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135021534] [2023-02-14 03:07:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:43,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922517259] [2023-02-14 03:07:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:43,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:43,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 03:07:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2023-02-14 03:07:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843793652] [2023-02-14 03:07:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:43,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843793652] [2023-02-14 03:07:43,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-14 03:07:43,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687418169] [2023-02-14 03:07:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:43,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:43,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 03:07:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:43,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 03:07:43,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-14 03:07:43,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 03:07:43,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687418169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:43,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:43,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 03:07:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983544422] [2023-02-14 03:07:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:43,941 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-14 03:07:44,147 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:44,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:44,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:44,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:44,148 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:44,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,148 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:44,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:44,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-14 03:07:44,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:44,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:44,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,173 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,175 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,184 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,412 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:44,412 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:44,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,413 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-14 03:07:44,416 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-14 03:07:44,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:44,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:44,441 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:44,441 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:44,447 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-14 03:07:44,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,449 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-14 03:07:44,451 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-14 03:07:44,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:44,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:44,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:44,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,509 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-14 03:07:44,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:44,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:44,538 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-14 03:07:44,569 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:44,576 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-14 03:07:44,576 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:44,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:44,577 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:44,577 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:44,577 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:44,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:44,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:44,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2023-02-14 03:07:44,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:44,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:44,578 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,581 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,583 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,585 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,589 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,591 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:44,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:44,841 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,842 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-14 03:07:44,855 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-14 03:07:44,856 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-14 03:07:44,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:44,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:44,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:44,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:44,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:44,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:44,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:44,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:44,871 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-14 03:07:44,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,873 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-14 03:07:44,875 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-14 03:07:44,877 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-14 03:07:44,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:44,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:44,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:44,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:44,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:44,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:44,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:44,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:44,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-14 03:07:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,915 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-14 03:07:44,931 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-14 03:07:44,931 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-14 03:07:44,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:44,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:44,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:44,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:44,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:44,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:44,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:44,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:44,961 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-14 03:07:44,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:44,963 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-14 03:07:44,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-14 03:07:44,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:44,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:44,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:44,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:44,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:44,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:44,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:44,995 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-14 03:07:45,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:45,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,025 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-14 03:07:45,035 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-14 03:07:45,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:45,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:45,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,046 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-14 03:07:45,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,065 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-14 03:07:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,067 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-14 03:07:45,072 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-14 03:07:45,072 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-14 03:07:45,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:45,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:45,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,086 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-14 03:07:45,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,088 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-14 03:07:45,096 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-14 03:07:45,098 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-14 03:07:45,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:45,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:45,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,130 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-14 03:07:45,130 INFO L490 LassoAnalysis]: Using template '2-nested'. [2023-02-14 03:07:45,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,131 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-14 03:07:45,134 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-14 03:07:45,135 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-14 03:07:45,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,142 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,142 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,171 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-14 03:07:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,183 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-14 03:07:45,187 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-14 03:07:45,187 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-14 03:07:45,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,203 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,203 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,234 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-14 03:07:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,235 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-14 03:07:45,247 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-14 03:07:45,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,254 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,254 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,257 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-14 03:07:45,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,278 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-14 03:07:45,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,283 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-14 03:07:45,285 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-14 03:07:45,286 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-14 03:07:45,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,293 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,294 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,314 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-14 03:07:45,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,316 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-14 03:07:45,318 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-14 03:07:45,319 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-14 03:07:45,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,326 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,326 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,347 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-14 03:07:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,348 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-14 03:07:45,350 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-14 03:07:45,352 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-14 03:07:45,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,358 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,359 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,385 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-14 03:07:45,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,401 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-14 03:07:45,404 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-14 03:07:45,405 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-14 03:07:45,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,413 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:45,416 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:45,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,438 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-14 03:07:45,438 INFO L490 LassoAnalysis]: Using template '3-nested'. [2023-02-14 03:07:45,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,440 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-14 03:07:45,466 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-14 03:07:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,473 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,474 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,475 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-14 03:07:45,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,491 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-14 03:07:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,492 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-14 03:07:45,494 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-14 03:07:45,496 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-14 03:07:45,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,521 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,522 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,537 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-14 03:07:45,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,538 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-14 03:07:45,540 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-14 03:07:45,542 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-14 03:07:45,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,552 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,553 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,558 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-14 03:07:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,561 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-14 03:07:45,563 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-14 03:07:45,566 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-14 03:07:45,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,572 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,573 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,588 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-14 03:07:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,591 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-14 03:07:45,595 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-14 03:07:45,597 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-14 03:07:45,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,604 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,604 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,619 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-14 03:07:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,621 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-14 03:07:45,624 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-14 03:07:45,626 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-14 03:07:45,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,633 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,633 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,653 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-14 03:07:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,654 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-14 03:07:45,656 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-14 03:07:45,708 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-14 03:07:45,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,717 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:45,722 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:45,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,767 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-14 03:07:45,767 INFO L490 LassoAnalysis]: Using template '4-nested'. [2023-02-14 03:07:45,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,769 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-14 03:07:45,772 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-14 03:07:45,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,780 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,780 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:45,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,801 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-14 03:07:45,802 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-14 03:07:45,806 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-14 03:07:45,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,813 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,814 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,850 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-14 03:07:45,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,851 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-14 03:07:45,853 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-14 03:07:45,855 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-14 03:07:45,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,862 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,862 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,899 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-14 03:07:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,914 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-14 03:07:45,916 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-14 03:07:45,917 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-14 03:07:45,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,924 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,925 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,938 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-14 03:07:45,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,939 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-14 03:07:45,941 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-14 03:07:45,943 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-14 03:07:45,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,950 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,950 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:45,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-14 03:07:45,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:45,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:45,985 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-14 03:07:45,989 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-14 03:07:45,989 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-14 03:07:45,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:45,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:45,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:45,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:45,997 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:45,998 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:45,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:45,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-02-14 03:07:46,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,004 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-14 03:07:46,005 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-14 03:07:46,019 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-14 03:07:46,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:46,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,028 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,034 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,055 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-14 03:07:46,055 INFO L490 LassoAnalysis]: Using template '2-phase'. [2023-02-14 03:07:46,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,056 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-14 03:07:46,073 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-14 03:07:46,073 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-14 03:07:46,081 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,081 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,081 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,082 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,123 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-14 03:07:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,149 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-14 03:07:46,189 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-14 03:07:46,189 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-14 03:07:46,196 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,196 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,197 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,197 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,214 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-14 03:07:46,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,216 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-14 03:07:46,218 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-14 03:07:46,219 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-14 03:07:46,227 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,227 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,228 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,228 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,251 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-14 03:07:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,253 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-14 03:07:46,255 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-14 03:07:46,256 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-14 03:07:46,263 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,263 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,263 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,264 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-02-14 03:07:46,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,281 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-14 03:07:46,286 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-14 03:07:46,292 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,292 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,293 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,293 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:46,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,308 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:46,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-14 03:07:46,312 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-14 03:07:46,318 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,318 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,319 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,319 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,355 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-14 03:07:46,357 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-14 03:07:46,359 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-14 03:07:46,366 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,366 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,366 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-02-14 03:07:46,370 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2023-02-14 03:07:46,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,390 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-14 03:07:46,391 INFO L490 LassoAnalysis]: Using template '3-phase'. [2023-02-14 03:07:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,392 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-14 03:07:46,394 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-14 03:07:46,395 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-14 03:07:46,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,402 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,403 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,404 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,422 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-14 03:07:46,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,424 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-14 03:07:46,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:07:46,442 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,442 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,442 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,443 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,446 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-14 03:07:46,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,468 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-14 03:07:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,469 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-14 03:07:46,471 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-14 03:07:46,473 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-14 03:07:46,480 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,480 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,481 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,481 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,500 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-14 03:07:46,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,502 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-14 03:07:46,503 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-14 03:07:46,505 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-14 03:07:46,513 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,513 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,513 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,521 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-02-14 03:07:46,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,560 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-14 03:07:46,562 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-14 03:07:46,563 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-14 03:07:46,570 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,570 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,570 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,571 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,577 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-14 03:07:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,578 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-14 03:07:46,580 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-14 03:07:46,581 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-14 03:07:46,588 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,588 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,588 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,589 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,606 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-14 03:07:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,608 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-14 03:07:46,609 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-14 03:07:46,612 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-14 03:07:46,621 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,622 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2023-02-14 03:07:46,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,622 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,636 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,689 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-14 03:07:46,689 INFO L490 LassoAnalysis]: Using template '4-phase'. [2023-02-14 03:07:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,691 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-14 03:07:46,692 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-14 03:07:46,694 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-14 03:07:46,701 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,701 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,701 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,702 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,721 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-14 03:07:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,722 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-14 03:07:46,743 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-14 03:07:46,743 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-14 03:07:46,750 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,750 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,750 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,751 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,761 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-14 03:07:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,762 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-14 03:07:46,764 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-14 03:07:46,765 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-14 03:07:46,773 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,773 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,773 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,774 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,793 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-14 03:07:46,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,794 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-14 03:07:46,795 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-14 03:07:46,798 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-14 03:07:46,805 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,805 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,806 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,807 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:46,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,822 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-14 03:07:46,824 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-14 03:07:46,825 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-14 03:07:46,832 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,832 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,832 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,833 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2023-02-14 03:07:46,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,860 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-14 03:07:46,862 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-14 03:07:46,864 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-14 03:07:46,871 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,871 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,871 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,872 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,881 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-14 03:07:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,882 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-14 03:07:46,885 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-14 03:07:46,887 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-14 03:07:46,899 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,899 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:46,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,899 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2023-02-14 03:07:46,909 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2023-02-14 03:07:46,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,949 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-14 03:07:46,949 INFO L490 LassoAnalysis]: Using template '2-lex'. [2023-02-14 03:07:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,950 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-14 03:07:46,952 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-14 03:07:46,954 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-14 03:07:46,960 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:46,961 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:46,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:46,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,961 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:46,961 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:46,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:46,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,979 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-14 03:07:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,981 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-14 03:07:46,996 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-14 03:07:46,998 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-14 03:07:47,007 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,007 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,008 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,010 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-02-14 03:07:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,018 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-14 03:07:47,020 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-14 03:07:47,022 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-14 03:07:47,031 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,031 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,031 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,032 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-02-14 03:07:47,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,040 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:47,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-02-14 03:07:47,044 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-14 03:07:47,052 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,053 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,053 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,054 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-02-14 03:07:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,070 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-14 03:07:47,071 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-14 03:07:47,072 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-14 03:07:47,080 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,080 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,081 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,081 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-02-14 03:07:47,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,089 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-14 03:07:47,091 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-14 03:07:47,092 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-14 03:07:47,101 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,101 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,102 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,105 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-02-14 03:07:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,115 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-14 03:07:47,116 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-14 03:07:47,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-14 03:07:47,127 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,127 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2023-02-14 03:07:47,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,127 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-02-14 03:07:47,153 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-14 03:07:47,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,167 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-14 03:07:47,167 INFO L490 LassoAnalysis]: Using template '3-lex'. [2023-02-14 03:07:47,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,169 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-14 03:07:47,170 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-14 03:07:47,172 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-14 03:07:47,180 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,181 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,181 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,200 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-14 03:07:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,202 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-14 03:07:47,204 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-14 03:07:47,206 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-14 03:07:47,215 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,216 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,216 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,224 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-14 03:07:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,226 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-14 03:07:47,228 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-14 03:07:47,231 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-14 03:07:47,240 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,240 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,240 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,250 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-14 03:07:47,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,252 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-14 03:07:47,254 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-14 03:07:47,255 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-14 03:07:47,285 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,285 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,285 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,302 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-14 03:07:47,303 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-14 03:07:47,334 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-14 03:07:47,341 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,341 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,341 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,355 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-14 03:07:47,357 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-14 03:07:47,359 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-14 03:07:47,366 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,366 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,366 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,373 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-14 03:07:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,375 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:47,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-02-14 03:07:47,378 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-14 03:07:47,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2023-02-14 03:07:47,387 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2023-02-14 03:07:47,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:47,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:47,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:47,388 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2023-02-14 03:07:47,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:47,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:47,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:47,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 03:07:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 03:07:47,422 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 03:07:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:47,467 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2023-02-14 03:07:47,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2023-02-14 03:07:47,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2023-02-14 03:07:47,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2023-02-14 03:07:47,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2023-02-14 03:07:47,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2023-02-14 03:07:47,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2023-02-14 03:07:47,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:47,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2023-02-14 03:07:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2023-02-14 03:07:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2023-02-14 03:07:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2023-02-14 03:07:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2023-02-14 03:07:47,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-14 03:07:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 03:07:47,490 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2023-02-14 03:07:47,490 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 03:07:47,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2023-02-14 03:07:47,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-14 03:07:47,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:47,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:47,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:47,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:47,496 INFO L748 eck$LassoCheckResult]: Stem: 548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 534#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 535#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 542#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 538#L41-3 [2023-02-14 03:07:47,496 INFO L750 eck$LassoCheckResult]: Loop: 538#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 539#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 544#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#$Ultimate##0 ~n := #in~n; 546#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 545#factFINAL assume true; 550#factEXIT >#72#return; 532#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 540#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 543#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 547#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 541#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 538#L41-3 [2023-02-14 03:07:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2023-02-14 03:07:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:47,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322080340] [2023-02-14 03:07:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2023-02-14 03:07:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269625576] [2023-02-14 03:07:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:47,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:47,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191420581] [2023-02-14 03:07:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,543 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:47,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-02-14 03:07:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:47,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:47,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-14 03:07:47,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-14 03:07:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269625576] [2023-02-14 03:07:47,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191420581] [2023-02-14 03:07:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191420581] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:47,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 03:07:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591003587] [2023-02-14 03:07:47,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:47,766 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 03:07:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 03:07:47,767 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-14 03:07:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:47,897 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2023-02-14 03:07:47,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2023-02-14 03:07:47,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2023-02-14 03:07:47,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2023-02-14 03:07:47,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-02-14 03:07:47,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-14 03:07:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2023-02-14 03:07:47,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:47,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2023-02-14 03:07:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2023-02-14 03:07:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2023-02-14 03:07:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-02-14 03:07:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2023-02-14 03:07:47,906 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-14 03:07:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 03:07:47,906 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2023-02-14 03:07:47,907 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 03:07:47,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2023-02-14 03:07:47,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2023-02-14 03:07:47,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:47,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:47,908 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-02-14 03:07:47,908 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:47,908 INFO L748 eck$LassoCheckResult]: Stem: 875#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 861#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 868#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 864#L41-3 [2023-02-14 03:07:47,908 INFO L750 eck$LassoCheckResult]: Loop: 864#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 865#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 870#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#68#return; 851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#70#return; 848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847#$Ultimate##0 ~n := #in~n; 874#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#72#return; 858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 866#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 869#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 872#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 864#L41-3 [2023-02-14 03:07:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2023-02-14 03:07:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206796508] [2023-02-14 03:07:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2023-02-14 03:07:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:47,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521788121] [2023-02-14 03:07:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:47,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:47,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379659956] [2023-02-14 03:07:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,935 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:47,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2023-02-14 03:07:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:47,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2023-02-14 03:07:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053838719] [2023-02-14 03:07:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:47,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:47,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599894787] [2023-02-14 03:07:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:47,997 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:48,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2023-02-14 03:07:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:48,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:48,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:48,242 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:48,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:48,242 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:48,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:48,242 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:48,242 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:48,242 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:48,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:48,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-14 03:07:48,242 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:48,242 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:48,243 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,246 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,259 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,261 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,263 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,265 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,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-14 03:07:48,336 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:48,337 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:48,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:48,341 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-14 03:07:48,342 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-14 03:07:48,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:48,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:48,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:48,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:48,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:48,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:48,365 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-14 03:07:48,366 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-14 03:07:48,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:48,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:48,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:48,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:48,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:48,383 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-14 03:07:48,385 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-14 03:07:48,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:48,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:48,893 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:48,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:48,898 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:48,899 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:48,899 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:48,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:48,899 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:48,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:48,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:48,899 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:48,899 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2023-02-14 03:07:48,899 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:48,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:48,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-14 03:07:48,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-14 03:07:48,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,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-14 03:07:48,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-14 03:07:48,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:48,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-14 03:07:48,936 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:49,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:49,034 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:49,036 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-14 03:07:49,038 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-14 03:07:49,040 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-14 03:07:49,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:49,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:49,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:49,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:49,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:49,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:49,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:49,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:49,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:49,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:49,069 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-14 03:07:49,071 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-14 03:07:49,073 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-14 03:07:49,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:49,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:49,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:49,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:49,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:49,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:49,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:49,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:49,086 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:07:49,087 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:07:49,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:49,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:49,089 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:49,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-02-14 03:07:49,091 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:49,091 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:07:49,091 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:49,091 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2023-02-14 03:07:49,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2023-02-14 03:07:49,096 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:07:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:49,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:07:49,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:49,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 03:07:49,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 03:07:49,263 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2023-02-14 03:07:49,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 03:07:49,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:49,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Result 123 states and 190 transitions. Complement of second has 26 states. [2023-02-14 03:07:49,510 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-14 03:07:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 03:07:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2023-02-14 03:07:49,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2023-02-14 03:07:49,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:49,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2023-02-14 03:07:49,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:49,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2023-02-14 03:07:49,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:49,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2023-02-14 03:07:49,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-14 03:07:49,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2023-02-14 03:07:49,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-02-14 03:07:49,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-14 03:07:49,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2023-02-14 03:07:49,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:49,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2023-02-14 03:07:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2023-02-14 03:07:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2023-02-14 03:07:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 76 states have internal predecessors, (86), 36 states have call successors, (36), 6 states have call predecessors, (36), 10 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2023-02-14 03:07:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2023-02-14 03:07:49,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-14 03:07:49,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2023-02-14 03:07:49,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 03:07:49,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2023-02-14 03:07:49,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2023-02-14 03:07:49,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:49,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:49,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:07:49,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:49,529 INFO L748 eck$LassoCheckResult]: Stem: 1203#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1165#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1182#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1204#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-14 03:07:49,529 INFO L750 eck$LassoCheckResult]: Loop: 1173#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1191#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1215#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1170#$Ultimate##0 ~n := #in~n; 1189#L25 assume ~n <= 0;#res := 1; 1154#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1225#factFINAL assume true; 1213#factEXIT >#68#return; 1218#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#70#return; 1217#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1222#$Ultimate##0 ~n := #in~n; 1228#L25 assume ~n <= 0;#res := 1; 1226#factFINAL assume true; 1223#factEXIT >#72#return; 1212#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1210#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1208#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1206#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1180#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1172#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1173#L42-3 [2023-02-14 03:07:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2023-02-14 03:07:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:49,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380539068] [2023-02-14 03:07:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:49,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:49,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:49,536 INFO L85 PathProgramCache]: Analyzing trace with hash -304298247, now seen corresponding path program 2 times [2023-02-14 03:07:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:49,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450492522] [2023-02-14 03:07:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:49,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:49,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680954761] [2023-02-14 03:07:49,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:07:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:49,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:49,551 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2023-02-14 03:07:49,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:07:49,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:07:49,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 03:07:49,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 03:07:49,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 03:07:49,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:49,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450492522] [2023-02-14 03:07:49,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:49,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680954761] [2023-02-14 03:07:49,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680954761] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:49,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:49,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-02-14 03:07:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862976976] [2023-02-14 03:07:49,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:49,769 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:49,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 03:07:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 03:07:49,770 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 03:07:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:50,005 INFO L93 Difference]: Finished difference Result 249 states and 362 transitions. [2023-02-14 03:07:50,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 362 transitions. [2023-02-14 03:07:50,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2023-02-14 03:07:50,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 362 transitions. [2023-02-14 03:07:50,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2023-02-14 03:07:50,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-14 03:07:50,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 362 transitions. [2023-02-14 03:07:50,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:50,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 362 transitions. [2023-02-14 03:07:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 362 transitions. [2023-02-14 03:07:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 131. [2023-02-14 03:07:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 80 states have internal predecessors, (94), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-14 03:07:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 202 transitions. [2023-02-14 03:07:50,023 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-14 03:07:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 03:07:50,024 INFO L428 stractBuchiCegarLoop]: Abstraction has 131 states and 202 transitions. [2023-02-14 03:07:50,024 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 03:07:50,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 202 transitions. [2023-02-14 03:07:50,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2023-02-14 03:07:50,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:50,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:50,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:07:50,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:50,029 INFO L748 eck$LassoCheckResult]: Stem: 1773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1728#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1729#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1756#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1774#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-14 03:07:50,029 INFO L750 eck$LassoCheckResult]: Loop: 1746#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1759#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1760#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#68#return; 1789#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1796#$Ultimate##0 ~n := #in~n; 1801#L25 assume ~n <= 0;#res := 1; 1800#factFINAL assume true; 1799#factEXIT >#70#return; 1787#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1794#$Ultimate##0 ~n := #in~n; 1798#L25 assume !(~n <= 0); 1700#L26 call #t~ret0 := fact(~n - 1);< 1734#$Ultimate##0 ~n := #in~n; 1804#L25 assume ~n <= 0;#res := 1; 1802#factFINAL assume true; 1698#factEXIT >#66#return; 1704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1795#factFINAL assume true; 1786#factEXIT >#72#return; 1793#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1784#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1782#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1781#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1753#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1745#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1746#L42-3 [2023-02-14 03:07:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2023-02-14 03:07:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888189571] [2023-02-14 03:07:50,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 3 times [2023-02-14 03:07:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029372333] [2023-02-14 03:07:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836474671] [2023-02-14 03:07:50,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:07:50,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:50,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:50,041 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:50,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2023-02-14 03:07:50,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-14 03:07:50,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:07:50,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 03:07:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-14 03:07:50,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 03:07:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:50,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029372333] [2023-02-14 03:07:50,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:50,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836474671] [2023-02-14 03:07:50,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836474671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:50,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:50,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 03:07:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323516435] [2023-02-14 03:07:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:50,096 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 03:07:50,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 03:07:50,097 INFO L87 Difference]: Start difference. First operand 131 states and 202 transitions. cyclomatic complexity: 76 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 03:07:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:50,144 INFO L93 Difference]: Finished difference Result 173 states and 268 transitions. [2023-02-14 03:07:50,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 268 transitions. [2023-02-14 03:07:50,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-14 03:07:50,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 167 states and 262 transitions. [2023-02-14 03:07:50,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-14 03:07:50,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-14 03:07:50,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 262 transitions. [2023-02-14 03:07:50,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:50,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 262 transitions. [2023-02-14 03:07:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 262 transitions. [2023-02-14 03:07:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2023-02-14 03:07:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 86 states have internal predecessors, (100), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (66), 40 states have call predecessors, (66), 42 states have call successors, (66) [2023-02-14 03:07:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 208 transitions. [2023-02-14 03:07:50,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-14 03:07:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 03:07:50,159 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 208 transitions. [2023-02-14 03:07:50,159 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-14 03:07:50,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 208 transitions. [2023-02-14 03:07:50,160 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2023-02-14 03:07:50,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:50,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:50,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:07:50,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:50,161 INFO L748 eck$LassoCheckResult]: Stem: 2176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2144#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2161#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2177#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-14 03:07:50,161 INFO L750 eck$LassoCheckResult]: Loop: 2152#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2216#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2205#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#68#return; 2201#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#70#return; 2208#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#72#return; 2210#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2245#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2223#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2181#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2202#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#74#return; 2203#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2213#$Ultimate##0 ~n := #in~n; 2218#L25 assume ~n <= 0;#res := 1; 2217#factFINAL assume true; 2215#factEXIT >#76#return; 2206#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2211#$Ultimate##0 ~n := #in~n; 2214#L25 assume !(~n <= 0); 2119#L26 call #t~ret0 := fact(~n - 1);< 2149#$Ultimate##0 ~n := #in~n; 2236#L25 assume ~n <= 0;#res := 1; 2134#factFINAL assume true; 2118#factEXIT >#66#return; 2124#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2212#factFINAL assume true; 2200#factEXIT >#78#return; 2199#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2194#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2182#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2180#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2155#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2151#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2152#L42-3 [2023-02-14 03:07:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2023-02-14 03:07:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398365548] [2023-02-14 03:07:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:50,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1715041092, now seen corresponding path program 1 times [2023-02-14 03:07:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644580178] [2023-02-14 03:07:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588533836] [2023-02-14 03:07:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:50,187 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:50,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2023-02-14 03:07:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:50,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:50,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-14 03:07:50,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-14 03:07:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644580178] [2023-02-14 03:07:50,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:50,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588533836] [2023-02-14 03:07:50,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588533836] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:50,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:50,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-14 03:07:50,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403961044] [2023-02-14 03:07:50,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:50,470 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:50,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 03:07:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-14 03:07:50,471 INFO L87 Difference]: Start difference. First operand 137 states and 208 transitions. cyclomatic complexity: 76 Second operand has 16 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 9 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 7 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-14 03:07:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:50,908 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2023-02-14 03:07:50,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 395 transitions. [2023-02-14 03:07:50,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2023-02-14 03:07:50,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 395 transitions. [2023-02-14 03:07:50,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2023-02-14 03:07:50,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2023-02-14 03:07:50,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 395 transitions. [2023-02-14 03:07:50,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:50,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 395 transitions. [2023-02-14 03:07:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 395 transitions. [2023-02-14 03:07:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 185. [2023-02-14 03:07:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 125 states have (on average 1.12) internal successors, (140), 122 states have internal predecessors, (140), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2023-02-14 03:07:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 272 transitions. [2023-02-14 03:07:50,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-14 03:07:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 03:07:50,923 INFO L428 stractBuchiCegarLoop]: Abstraction has 185 states and 272 transitions. [2023-02-14 03:07:50,923 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-14 03:07:50,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 272 transitions. [2023-02-14 03:07:50,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2023-02-14 03:07:50,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:50,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:50,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:07:50,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 9, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:50,926 INFO L748 eck$LassoCheckResult]: Stem: 3031#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2993#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3010#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 3032#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-14 03:07:50,926 INFO L750 eck$LassoCheckResult]: Loop: 3001#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3082#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3054#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#70#return; 3058#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#72#return; 3062#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3137#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3079#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3077#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3060#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#68#return; 3053#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#70#return; 3057#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#72#return; 3074#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3073#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 3071#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 3035#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 3043#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#74#return; 3055#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3065#$Ultimate##0 ~n := #in~n; 3072#L25 assume ~n <= 0;#res := 1; 3076#factFINAL assume true; 3075#factEXIT >#76#return; 3056#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3063#$Ultimate##0 ~n := #in~n; 3070#L25 assume !(~n <= 0); 3025#L26 call #t~ret0 := fact(~n - 1);< 2997#$Ultimate##0 ~n := #in~n; 3026#L25 assume ~n <= 0;#res := 1; 3078#factFINAL assume true; 3067#factEXIT >#66#return; 3066#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 3064#factFINAL assume true; 3052#factEXIT >#78#return; 3047#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 3041#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 3036#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 3034#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 3007#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3000#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 3001#L42-3 [2023-02-14 03:07:50,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2023-02-14 03:07:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904888372] [2023-02-14 03:07:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:50,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1813506637, now seen corresponding path program 2 times [2023-02-14 03:07:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:50,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830356861] [2023-02-14 03:07:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:50,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:50,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638215052] [2023-02-14 03:07:50,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:07:50,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:50,941 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:50,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2023-02-14 03:07:50,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:07:50,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:07:50,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 03:07:51,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 230 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-02-14 03:07:51,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 79 proven. 134 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2023-02-14 03:07:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830356861] [2023-02-14 03:07:51,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:51,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638215052] [2023-02-14 03:07:51,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638215052] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:51,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:51,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2023-02-14 03:07:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309207297] [2023-02-14 03:07:51,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:51,441 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 03:07:51,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-14 03:07:51,441 INFO L87 Difference]: Start difference. First operand 185 states and 272 transitions. cyclomatic complexity: 92 Second operand has 18 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 16 states have internal predecessors, (45), 11 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2023-02-14 03:07:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:51,893 INFO L93 Difference]: Finished difference Result 337 states and 498 transitions. [2023-02-14 03:07:51,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 498 transitions. [2023-02-14 03:07:51,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2023-02-14 03:07:51,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 337 states and 498 transitions. [2023-02-14 03:07:51,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2023-02-14 03:07:51,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2023-02-14 03:07:51,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 498 transitions. [2023-02-14 03:07:51,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:51,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 337 states and 498 transitions. [2023-02-14 03:07:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 498 transitions. [2023-02-14 03:07:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2023-02-14 03:07:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 145 states have (on average 1.1172413793103448) internal successors, (162), 144 states have internal predecessors, (162), 50 states have call successors, (50), 10 states have call predecessors, (50), 16 states have return successors, (104), 56 states have call predecessors, (104), 50 states have call successors, (104) [2023-02-14 03:07:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 316 transitions. [2023-02-14 03:07:51,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-14 03:07:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 03:07:51,913 INFO L428 stractBuchiCegarLoop]: Abstraction has 211 states and 316 transitions. [2023-02-14 03:07:51,913 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-14 03:07:51,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 316 transitions. [2023-02-14 03:07:51,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2023-02-14 03:07:51,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:51,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:51,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-14 03:07:51,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:51,915 INFO L748 eck$LassoCheckResult]: Stem: 4185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4145#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4168#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 4186#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-14 03:07:51,916 INFO L750 eck$LassoCheckResult]: Loop: 4159#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4214#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4201#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4193#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#70#return; 4194#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#72#return; 4204#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4231#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4230#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4228#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4203#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#68#return; 4196#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#70#return; 4195#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume ~n <= 0;#res := 1; 4210#factFINAL assume true; 4207#factEXIT >#72#return; 4208#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4237#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4234#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4233#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4188#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 4200#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume !(~n <= 0); 4218#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4219#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4221#factFINAL assume true; 4217#factEXIT >#66#return; 4216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4215#factFINAL assume true; 4211#factEXIT >#74#return; 4202#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 4209#$Ultimate##0 ~n := #in~n; 4212#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#76#return; 4199#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4206#$Ultimate##0 ~n := #in~n; 4220#L25 assume !(~n <= 0); 4213#L26 call #t~ret0 := fact(~n - 1);< 4153#$Ultimate##0 ~n := #in~n; 4227#L25 assume ~n <= 0;#res := 1; 4225#factFINAL assume true; 4222#factEXIT >#66#return; 4224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4226#factFINAL assume true; 4192#factEXIT >#78#return; 4191#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 4190#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4187#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4166#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4158#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4159#L42-3 [2023-02-14 03:07:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2023-02-14 03:07:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:51,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402377988] [2023-02-14 03:07:51,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:51,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:51,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:51,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 3 times [2023-02-14 03:07:51,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141128760] [2023-02-14 03:07:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:51,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:51,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399714202] [2023-02-14 03:07:51,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:07:51,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:51,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:51,930 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:51,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2023-02-14 03:07:52,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-14 03:07:52,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:07:52,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:52,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash -552239216, now seen corresponding path program 1 times [2023-02-14 03:07:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862840375] [2023-02-14 03:07:52,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:52,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:52,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455180324] [2023-02-14 03:07:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:52,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:52,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:52,133 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2023-02-14 03:07:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:52,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:52,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 143 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2023-02-14 03:07:52,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2023-02-14 03:07:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862840375] [2023-02-14 03:07:52,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:52,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455180324] [2023-02-14 03:07:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455180324] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:52,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 03:07:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706123590] [2023-02-14 03:07:52,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:55,808 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:55,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:55,809 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:55,809 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:55,809 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:55,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:55,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:55,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:55,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-14 03:07:55,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:55,809 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:55,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-14 03:07:55,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-14 03:07:55,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-14 03:07:55,819 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:55,821 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:55,822 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:55,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:55,825 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:55,826 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,173 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:56,174 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,176 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-14 03:07:56,177 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-14 03:07:56,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,194 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,194 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,197 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-14 03:07:56,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,199 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-14 03:07:56,201 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-14 03:07:56,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,211 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,211 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,213 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-14 03:07:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,215 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-14 03:07:56,217 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-14 03:07:56,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,225 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,225 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,228 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-14 03:07:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,229 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-14 03:07:56,231 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-14 03:07:56,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,249 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-14 03:07:56,252 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-14 03:07:56,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,254 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-14 03:07:56,254 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-14 03:07:56,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,265 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,265 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2023-02-14 03:07:56,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,271 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:07:56,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-02-14 03:07:56,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,274 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:56,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,289 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-14 03:07:56,293 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-14 03:07:56,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,302 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,302 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,305 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-14 03:07:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,306 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-14 03:07:56,308 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-14 03:07:56,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:07:56,318 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:07:56,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2023-02-14 03:07:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,329 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-14 03:07:56,332 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-14 03:07:56,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:56,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:56,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,348 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-14 03:07:56,350 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-14 03:07:56,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:56,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:56,376 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:56,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-02-14 03:07:56,381 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:56,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:56,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:56,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:56,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:56,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:56,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:56,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration10_Loop [2023-02-14 03:07:56,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:56,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:56,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,452 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,458 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:56,657 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:56,658 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:56,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,659 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-14 03:07:56,661 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-14 03:07:56,662 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-14 03:07:56,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:56,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:56,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:56,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:56,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:56,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:56,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:56,673 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:56,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:07:56,676 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:07:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:56,679 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-14 03:07:56,679 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-14 03:07:56,680 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:56,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:07:56,681 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:56,681 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-02-14 03:07:56,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2023-02-14 03:07:56,684 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:07:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:56,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:07:56,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:56,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-14 03:07:56,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:56,967 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-14 03:07:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 29 proven. 94 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2023-02-14 03:07:57,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2023-02-14 03:07:57,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110 Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-14 03:07:57,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 316 transitions. cyclomatic complexity: 110. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Result 1010 states and 1427 transitions. Complement of second has 48 states. [2023-02-14 03:07:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 03:07:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 5 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2023-02-14 03:07:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2023-02-14 03:07:57,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 5 letters. Loop has 111 letters. [2023-02-14 03:07:57,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:57,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 116 letters. Loop has 111 letters. [2023-02-14 03:07:57,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:57,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 106 transitions. Stem has 5 letters. Loop has 222 letters. [2023-02-14 03:07:57,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:57,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1010 states and 1427 transitions. [2023-02-14 03:07:57,474 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 03:07:57,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1010 states to 482 states and 654 transitions. [2023-02-14 03:07:57,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2023-02-14 03:07:57,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2023-02-14 03:07:57,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 654 transitions. [2023-02-14 03:07:57,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:57,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 654 transitions. [2023-02-14 03:07:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 654 transitions. [2023-02-14 03:07:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 466. [2023-02-14 03:07:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 320 states have (on average 1.08125) internal successors, (346), 320 states have internal predecessors, (346), 95 states have call successors, (95), 33 states have call predecessors, (95), 51 states have return successors, (182), 112 states have call predecessors, (182), 93 states have call successors, (182) [2023-02-14 03:07:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2023-02-14 03:07:57,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 466 states and 623 transitions. [2023-02-14 03:07:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 03:07:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 03:07:57,500 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-14 03:07:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:57,603 INFO L93 Difference]: Finished difference Result 530 states and 714 transitions. [2023-02-14 03:07:57,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 714 transitions. [2023-02-14 03:07:57,608 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2023-02-14 03:07:57,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 516 states and 697 transitions. [2023-02-14 03:07:57,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2023-02-14 03:07:57,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2023-02-14 03:07:57,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 697 transitions. [2023-02-14 03:07:57,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:57,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 516 states and 697 transitions. [2023-02-14 03:07:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 697 transitions. [2023-02-14 03:07:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 487. [2023-02-14 03:07:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 333 states have (on average 1.075075075075075) internal successors, (358), 335 states have internal predecessors, (358), 103 states have call successors, (103), 33 states have call predecessors, (103), 51 states have return successors, (190), 118 states have call predecessors, (190), 99 states have call successors, (190) [2023-02-14 03:07:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 651 transitions. [2023-02-14 03:07:57,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 487 states and 651 transitions. [2023-02-14 03:07:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 03:07:57,630 INFO L428 stractBuchiCegarLoop]: Abstraction has 487 states and 651 transitions. [2023-02-14 03:07:57,630 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-14 03:07:57,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 487 states and 651 transitions. [2023-02-14 03:07:57,632 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 03:07:57,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:57,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:57,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:57,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:57,634 INFO L748 eck$LassoCheckResult]: Stem: 7562#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 7496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7497#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7535#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 7524#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7526#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7626#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 7620#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7621#$Ultimate##0 ~n := #in~n; 7804#L25 assume !(~n <= 0); 7588#L26 call #t~ret0 := fact(~n - 1);< 7513#$Ultimate##0 [2023-02-14 03:07:57,634 INFO L750 eck$LassoCheckResult]: Loop: 7513#$Ultimate##0 ~n := #in~n; 7610#L25 assume !(~n <= 0); 7589#L26 call #t~ret0 := fact(~n - 1);< 7513#$Ultimate##0 [2023-02-14 03:07:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2023-02-14 03:07:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:57,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464463943] [2023-02-14 03:07:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:57,693 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-14 03:07:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464463943] [2023-02-14 03:07:57,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464463943] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:57,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:57,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 03:07:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016552327] [2023-02-14 03:07:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:57,694 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:07:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2023-02-14 03:07:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:57,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733661430] [2023-02-14 03:07:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:57,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:57,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:57,718 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:57,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:57,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:57,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:57,719 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:57,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:57,719 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:57,719 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-14 03:07:57,719 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:57,719 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:57,720 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,723 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,725 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,726 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:57,740 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:57,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:57,741 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-14 03:07:57,743 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-14 03:07:57,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:57,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:57,781 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-14 03:07:57,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:57,782 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-14 03:07:57,784 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-14 03:07:57,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:57,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:57,837 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:57,840 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-14 03:07:57,841 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:57,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:57,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:57,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:57,841 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:57,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:57,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:57,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration11_Loop [2023-02-14 03:07:57,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:57,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:57,841 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,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-14 03:07:57,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-14 03:07:57,864 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:57,881 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:57,881 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:57,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:57,882 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-14 03:07:57,884 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-14 03:07:57,886 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-14 03:07:57,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:57,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:57,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:57,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:57,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:57,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:57,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:57,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:57,899 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:07:57,899 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:07:57,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:57,901 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-14 03:07:57,903 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-14 03:07:57,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:57,904 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:07:57,904 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:57,904 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-14 03:07:57,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-02-14 03:07:57,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:07:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:57,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:57,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:57,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:07:57,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:57,956 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-14 03:07:57,957 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-14 03:07:57,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 487 states and 651 transitions. cyclomatic complexity: 173 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 03:07:58,015 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 487 states and 651 transitions. cyclomatic complexity: 173. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 561 states and 749 transitions. Complement of second has 13 states. [2023-02-14 03:07:58,029 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-14 03:07:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 03:07:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2023-02-14 03:07:58,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-14 03:07:58,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:58,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-14 03:07:58,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:58,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-14 03:07:58,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:58,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 749 transitions. [2023-02-14 03:07:58,035 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 03:07:58,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 546 states and 725 transitions. [2023-02-14 03:07:58,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2023-02-14 03:07:58,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2023-02-14 03:07:58,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 725 transitions. [2023-02-14 03:07:58,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:58,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 725 transitions. [2023-02-14 03:07:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 725 transitions. [2023-02-14 03:07:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2023-02-14 03:07:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 373 states have (on average 1.0804289544235925) internal successors, (403), 378 states have internal predecessors, (403), 110 states have call successors, (110), 43 states have call predecessors, (110), 59 states have return successors, (204), 120 states have call predecessors, (204), 106 states have call successors, (204) [2023-02-14 03:07:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 717 transitions. [2023-02-14 03:07:58,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 542 states and 717 transitions. [2023-02-14 03:07:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 03:07:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 03:07:58,073 INFO L87 Difference]: Start difference. First operand 542 states and 717 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-14 03:07:58,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:58,143 INFO L93 Difference]: Finished difference Result 563 states and 749 transitions. [2023-02-14 03:07:58,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 749 transitions. [2023-02-14 03:07:58,148 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2023-02-14 03:07:58,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 546 states and 729 transitions. [2023-02-14 03:07:58,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2023-02-14 03:07:58,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2023-02-14 03:07:58,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 546 states and 729 transitions. [2023-02-14 03:07:58,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:58,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 546 states and 729 transitions. [2023-02-14 03:07:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states and 729 transitions. [2023-02-14 03:07:58,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 529. [2023-02-14 03:07:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 363 states have (on average 1.0798898071625345) internal successors, (392), 367 states have internal predecessors, (392), 107 states have call successors, (107), 43 states have call predecessors, (107), 59 states have return successors, (200), 118 states have call predecessors, (200), 105 states have call successors, (200) [2023-02-14 03:07:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 699 transitions. [2023-02-14 03:07:58,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 529 states and 699 transitions. [2023-02-14 03:07:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 03:07:58,175 INFO L428 stractBuchiCegarLoop]: Abstraction has 529 states and 699 transitions. [2023-02-14 03:07:58,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-14 03:07:58,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 529 states and 699 transitions. [2023-02-14 03:07:58,177 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 37 [2023-02-14 03:07:58,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:58,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:58,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:58,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:58,192 INFO L748 eck$LassoCheckResult]: Stem: 9778#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9720#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9744#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 9733#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9735#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10089#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9756#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10088#$Ultimate##0 ~n := #in~n; 9755#L25 assume ~n <= 0;#res := 1; 9757#factFINAL assume true; 10087#factEXIT >#68#return; 10077#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 10076#$Ultimate##0 ~n := #in~n; 10079#L25 assume ~n <= 0;#res := 1; 10086#factFINAL assume true; 10085#factEXIT >#70#return; 10078#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10076#$Ultimate##0 ~n := #in~n; 10079#L25 assume ~n <= 0;#res := 1; 10086#factFINAL assume true; 10085#factEXIT >#72#return; 10084#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 10083#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 10082#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 10081#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10080#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9696#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9697#$Ultimate##0 ~n := #in~n; 9859#L25 assume !(~n <= 0); 9725#L26 call #t~ret0 := fact(~n - 1);< 9726#$Ultimate##0 ~n := #in~n; 9834#L25 assume ~n <= 0;#res := 1; 9852#factFINAL assume true; 9851#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#74#return; 9772#L30-6 [2023-02-14 03:07:58,193 INFO L750 eck$LassoCheckResult]: Loop: 9772#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9773#$Ultimate##0 ~n := #in~n; 9799#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#76#return; 9779#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9780#$Ultimate##0 ~n := #in~n; 9853#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9829#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 10203#factFINAL assume true; 9782#factEXIT >#78#return; 9721#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9722#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9776#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 10137#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9783#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9780#$Ultimate##0 ~n := #in~n; 9853#L25 assume !(~n <= 0); 9800#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume !(~n <= 0); 9809#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume !(~n <= 0); 9809#L26 call #t~ret0 := fact(~n - 1);< 9817#$Ultimate##0 ~n := #in~n; 9835#L25 assume ~n <= 0;#res := 1; 9836#factFINAL assume true; 9827#factEXIT >#66#return; 9811#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9819#factFINAL assume true; 9803#factEXIT >#66#return; 9811#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9819#factFINAL assume true; 9803#factEXIT >#66#return; 9813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9786#factFINAL assume true; 9787#factEXIT >#74#return; 9772#L30-6 [2023-02-14 03:07:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2023-02-14 03:07:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413909153] [2023-02-14 03:07:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:58,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:58,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358604125] [2023-02-14 03:07:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:58,214 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:58,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2023-02-14 03:07:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:58,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:58,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1167330940, now seen corresponding path program 1 times [2023-02-14 03:07:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:58,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183335982] [2023-02-14 03:07:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:58,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592171178] [2023-02-14 03:07:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:58,275 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:58,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2023-02-14 03:07:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:58,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:58,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1873696258, now seen corresponding path program 1 times [2023-02-14 03:07:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:58,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104338091] [2023-02-14 03:07:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:58,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878386555] [2023-02-14 03:07:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:58,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:58,344 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-14 03:07:58,345 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-14 03:07:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:58,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:58,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 209 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-02-14 03:07:58,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:07:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-02-14 03:07:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104338091] [2023-02-14 03:07:58,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:07:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878386555] [2023-02-14 03:07:58,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878386555] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:07:58,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:07:58,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2023-02-14 03:07:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118952659] [2023-02-14 03:07:58,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:07:59,008 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:59,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:59,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:59,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:59,008 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:07:59,008 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:59,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:59,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-14 03:07:59,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:59,008 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:59,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-14 03:07:59,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-14 03:07:59,028 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,029 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,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-14 03:07:59,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,100 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:59,100 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:07:59,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,103 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-14 03:07:59,113 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-14 03:07:59,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:07:59,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:59,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:59,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,126 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-14 03:07:59,130 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-14 03:07:59,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:07:59,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:07:59,147 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:07:59,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-02-14 03:07:59,151 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:59,151 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:59,151 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:59,151 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:59,152 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:59,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:59,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:59,152 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2023-02-14 03:07:59,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:59,152 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:59,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,192 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:07:59,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-14 03:07:59,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-14 03:07:59,293 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:59,293 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:59,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,295 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-14 03:07:59,297 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-14 03:07:59,298 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-14 03:07:59,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:59,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:59,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:59,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:59,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:59,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:59,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:59,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:59,325 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:07:59,325 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:07:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,328 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-14 03:07:59,329 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-14 03:07:59,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:59,330 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:07:59,330 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:59,330 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~k~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2023-02-14 03:07:59,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:59,334 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:07:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:59,391 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-14 03:07:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:59,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:59,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:59,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 03:07:59,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-02-14 03:07:59,641 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-14 03:07:59,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 529 states and 699 transitions. cyclomatic complexity: 181 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-14 03:07:59,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 529 states and 699 transitions. cyclomatic complexity: 181. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Result 711 states and 920 transitions. Complement of second has 15 states. [2023-02-14 03:07:59,716 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-14 03:07:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-14 03:07:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2023-02-14 03:07:59,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 38 letters. Loop has 50 letters. [2023-02-14 03:07:59,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:59,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 88 letters. Loop has 50 letters. [2023-02-14 03:07:59,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:59,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 38 letters. Loop has 100 letters. [2023-02-14 03:07:59,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:59,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 920 transitions. [2023-02-14 03:07:59,727 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 03:07:59,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 705 states and 913 transitions. [2023-02-14 03:07:59,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2023-02-14 03:07:59,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2023-02-14 03:07:59,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 913 transitions. [2023-02-14 03:07:59,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:59,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 705 states and 913 transitions. [2023-02-14 03:07:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 913 transitions. [2023-02-14 03:07:59,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 675. [2023-02-14 03:07:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 456 states have (on average 1.094298245614035) internal successors, (499), 464 states have internal predecessors, (499), 133 states have call successors, (135), 59 states have call predecessors, (135), 86 states have return successors, (247), 151 states have call predecessors, (247), 130 states have call successors, (247) [2023-02-14 03:07:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 881 transitions. [2023-02-14 03:07:59,755 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 881 transitions. [2023-02-14 03:07:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 03:07:59,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 03:07:59,755 INFO L87 Difference]: Start difference. First operand 675 states and 881 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-14 03:07:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:59,847 INFO L93 Difference]: Finished difference Result 693 states and 889 transitions. [2023-02-14 03:07:59,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 693 states and 889 transitions. [2023-02-14 03:07:59,852 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 03:07:59,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 693 states to 675 states and 864 transitions. [2023-02-14 03:07:59,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 250 [2023-02-14 03:07:59,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2023-02-14 03:07:59,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 864 transitions. [2023-02-14 03:07:59,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:59,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 864 transitions. [2023-02-14 03:07:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 864 transitions. [2023-02-14 03:07:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 667. [2023-02-14 03:07:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 451 states have (on average 1.0886917960088691) internal successors, (491), 461 states have internal predecessors, (491), 130 states have call successors, (132), 59 states have call predecessors, (132), 86 states have return successors, (231), 146 states have call predecessors, (231), 126 states have call successors, (231) [2023-02-14 03:07:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 854 transitions. [2023-02-14 03:07:59,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 667 states and 854 transitions. [2023-02-14 03:07:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 03:07:59,872 INFO L428 stractBuchiCegarLoop]: Abstraction has 667 states and 854 transitions. [2023-02-14 03:07:59,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-14 03:07:59,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 854 transitions. [2023-02-14 03:07:59,876 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 40 [2023-02-14 03:07:59,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:59,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:59,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:59,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:59,877 INFO L748 eck$LassoCheckResult]: Stem: 13220#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 13161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13162#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 13184#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 13173#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13590#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13587#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13588#$Ultimate##0 ~n := #in~n; 13593#L25 assume ~n <= 0;#res := 1; 13591#factFINAL assume true; 13586#factEXIT >#68#return; 13582#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13584#$Ultimate##0 ~n := #in~n; 13589#L25 assume ~n <= 0;#res := 1; 13585#factFINAL assume true; 13581#factEXIT >#70#return; 13583#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13584#$Ultimate##0 ~n := #in~n; 13589#L25 assume ~n <= 0;#res := 1; 13585#factFINAL assume true; 13581#factEXIT >#72#return; 13579#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 13573#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 13571#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13569#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13568#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13520#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13521#$Ultimate##0 ~n := #in~n; 13716#L25 assume !(~n <= 0); 13566#L26 call #t~ret0 := fact(~n - 1);< 13567#$Ultimate##0 ~n := #in~n; 13633#L25 assume ~n <= 0;#res := 1; 13634#factFINAL assume true; 13565#factEXIT >#66#return; 13564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13562#factFINAL assume true; 13519#factEXIT >#74#return; 13514#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 13516#$Ultimate##0 ~n := #in~n; 13608#L25 assume ~n <= 0;#res := 1; 13602#factFINAL assume true; 13559#factEXIT >#76#return; 13501#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 13518#$Ultimate##0 ~n := #in~n; 13580#L25 assume !(~n <= 0); 13575#L26 call #t~ret0 := fact(~n - 1);< 13578#$Ultimate##0 ~n := #in~n; 13594#L25 assume ~n <= 0;#res := 1; 13595#factFINAL assume true; 13596#factEXIT >#66#return; 13597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 13724#factFINAL assume true; 13500#factEXIT >#78#return; 13504#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 13492#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 13493#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 13485#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 13480#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13476#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13377#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 13372#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 13366#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 13371#$Ultimate##0 ~n := #in~n; 13723#L25 assume !(~n <= 0); 13247#L26 call #t~ret0 := fact(~n - 1);< 13259#$Ultimate##0 [2023-02-14 03:07:59,878 INFO L750 eck$LassoCheckResult]: Loop: 13259#$Ultimate##0 ~n := #in~n; 13283#L25 assume !(~n <= 0); 13249#L26 call #t~ret0 := fact(~n - 1);< 13259#$Ultimate##0 [2023-02-14 03:07:59,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -665529474, now seen corresponding path program 2 times [2023-02-14 03:07:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:59,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302023312] [2023-02-14 03:07:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:59,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891717037] [2023-02-14 03:07:59,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:07:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,899 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:07:59,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2023-02-14 03:07:59,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:07:59,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:07:59,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:59,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2023-02-14 03:07:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:59,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131886978] [2023-02-14 03:07:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:59,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:59,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1219521409, now seen corresponding path program 3 times [2023-02-14 03:07:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:59,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436314273] [2023-02-14 03:07:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:59,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:07:59,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746177317] [2023-02-14 03:07:59,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:07:59,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:07:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:59,993 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:00,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2023-02-14 03:08:00,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-14 03:08:00,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:00,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 03:08:00,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-02-14 03:08:00,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-02-14 03:08:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436314273] [2023-02-14 03:08:00,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746177317] [2023-02-14 03:08:00,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746177317] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:00,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:00,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-14 03:08:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588741351] [2023-02-14 03:08:00,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:00,195 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:00,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:00,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:00,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:00,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:08:00,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:00,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:00,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-14 03:08:00,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:00,195 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:00,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-14 03:08:00,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,199 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,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-14 03:08:00,220 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:00,220 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:08:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,223 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:00,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-02-14 03:08:00,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:00,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:00,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:00,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:00,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:00,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,252 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:00,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-02-14 03:08:00,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:00,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:00,264 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:00,264 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:00,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:00,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,269 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:00,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-02-14 03:08:00,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:00,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:00,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2023-02-14 03:08:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,296 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-14 03:08:00,298 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-14 03:08:00,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:08:00,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:00,367 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:08:00,372 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-14 03:08:00,372 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:00,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:00,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:00,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:00,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:08:00,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:00,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:00,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2023-02-14 03:08:00,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:00,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:00,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:00,403 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:00,403 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:08:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,405 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-14 03:08:00,406 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-14 03:08:00,408 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-14 03:08:00,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:00,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:00,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:00,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:00,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:00,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:00,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:00,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:00,432 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-14 03:08:00,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,434 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-14 03:08:00,436 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-14 03:08:00,470 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-14 03:08:00,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:00,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:00,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:00,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:00,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:00,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:00,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:00,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:00,482 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-14 03:08:00,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,483 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-14 03:08:00,485 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-14 03:08:00,487 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-14 03:08:00,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:00,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:00,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:00,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:00,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:00,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:00,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:00,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:08:00,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:08:00,498 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:08:00,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:00,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:00,501 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-14 03:08:00,501 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-14 03:08:00,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:08:00,502 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:08:00,502 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:08:00,502 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2023-02-14 03:08:00,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:00,506 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:08:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:00,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 03:08:00,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:00,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:00,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:00,864 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-14 03:08:00,865 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 03:08:00,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:00,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 691 states and 882 transitions. Complement of second has 13 states. [2023-02-14 03:08:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-14 03:08:00,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 03:08:00,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:00,926 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:00,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 03:08:00,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:01,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:01,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:01,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:01,233 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-14 03:08:01,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 03:08:01,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:01,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 691 states and 882 transitions. Complement of second has 13 states. [2023-02-14 03:08:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2023-02-14 03:08:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 03:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:01,293 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:01,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 03:08:01,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:01,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:01,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:01,612 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-14 03:08:01,613 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2023-02-14 03:08:01,613 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204 Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:01,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 854 transitions. cyclomatic complexity: 204. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Result 809 states and 1014 transitions. Complement of second has 16 states. [2023-02-14 03:08:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2023-02-14 03:08:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 66 letters. Loop has 3 letters. [2023-02-14 03:08:01,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:01,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 69 letters. Loop has 3 letters. [2023-02-14 03:08:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:01,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 66 letters. Loop has 6 letters. [2023-02-14 03:08:01,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:01,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 809 states and 1014 transitions. [2023-02-14 03:08:01,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 03:08:01,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 809 states to 604 states and 785 transitions. [2023-02-14 03:08:01,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2023-02-14 03:08:01,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2023-02-14 03:08:01,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 785 transitions. [2023-02-14 03:08:01,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:01,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 785 transitions. [2023-02-14 03:08:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 785 transitions. [2023-02-14 03:08:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 592. [2023-02-14 03:08:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 408 states have (on average 1.088235294117647) internal successors, (444), 412 states have internal predecessors, (444), 110 states have call successors, (111), 51 states have call predecessors, (111), 74 states have return successors, (206), 128 states have call predecessors, (206), 110 states have call successors, (206) [2023-02-14 03:08:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 761 transitions. [2023-02-14 03:08:01,712 INFO L240 hiAutomatonCegarLoop]: Abstraction has 592 states and 761 transitions. [2023-02-14 03:08:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:01,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 03:08:01,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-14 03:08:01,713 INFO L87 Difference]: Start difference. First operand 592 states and 761 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 03:08:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:01,849 INFO L93 Difference]: Finished difference Result 925 states and 1217 transitions. [2023-02-14 03:08:01,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 925 states and 1217 transitions. [2023-02-14 03:08:01,856 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2023-02-14 03:08:01,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 925 states to 855 states and 1122 transitions. [2023-02-14 03:08:01,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2023-02-14 03:08:01,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2023-02-14 03:08:01,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 855 states and 1122 transitions. [2023-02-14 03:08:01,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:01,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 855 states and 1122 transitions. [2023-02-14 03:08:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states and 1122 transitions. [2023-02-14 03:08:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 763. [2023-02-14 03:08:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 521 states have (on average 1.0767754318618041) internal successors, (561), 528 states have internal predecessors, (561), 153 states have call successors, (154), 66 states have call predecessors, (154), 89 states have return successors, (263), 168 states have call predecessors, (263), 153 states have call successors, (263) [2023-02-14 03:08:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 978 transitions. [2023-02-14 03:08:01,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 763 states and 978 transitions. [2023-02-14 03:08:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 03:08:01,882 INFO L428 stractBuchiCegarLoop]: Abstraction has 763 states and 978 transitions. [2023-02-14 03:08:01,882 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-14 03:08:01,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 763 states and 978 transitions. [2023-02-14 03:08:01,885 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 03:08:01,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:01,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:01,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 10, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:01,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:01,886 INFO L748 eck$LassoCheckResult]: Stem: 18714#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 18658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 18659#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 18679#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 18669#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18670#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18918#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18904#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18905#$Ultimate##0 ~n := #in~n; 18909#L25 assume ~n <= 0;#res := 1; 18906#factFINAL assume true; 18903#factEXIT >#68#return; 18893#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18895#$Ultimate##0 ~n := #in~n; 18908#L25 assume ~n <= 0;#res := 1; 18902#factFINAL assume true; 18892#factEXIT >#70#return; 18894#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18895#$Ultimate##0 ~n := #in~n; 18908#L25 assume ~n <= 0;#res := 1; 18902#factFINAL assume true; 18892#factEXIT >#72#return; 18888#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18885#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 18880#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18873#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18869#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18864#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18867#$Ultimate##0 ~n := #in~n; 18971#L25 assume !(~n <= 0); 18969#L26 call #t~ret0 := fact(~n - 1);< 18970#$Ultimate##0 ~n := #in~n; 18978#L25 assume ~n <= 0;#res := 1; 18979#factFINAL assume true; 18968#factEXIT >#66#return; 18967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18966#factFINAL assume true; 18863#factEXIT >#74#return; 18865#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18915#$Ultimate##0 ~n := #in~n; 18946#L25 assume ~n <= 0;#res := 1; 18944#factFINAL assume true; 18926#factEXIT >#76#return; 18849#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18850#$Ultimate##0 ~n := #in~n; 18884#L25 assume !(~n <= 0); 18876#L26 call #t~ret0 := fact(~n - 1);< 18879#$Ultimate##0 ~n := #in~n; 18891#L25 assume ~n <= 0;#res := 1; 18917#factFINAL assume true; 18911#factEXIT >#66#return; 18910#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18907#factFINAL assume true; 18846#factEXIT >#78#return; 18845#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18844#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 18843#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18842#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 18792#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18793#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 18821#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18818#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18798#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18808#$Ultimate##0 ~n := #in~n; 18948#L25 assume ~n <= 0;#res := 1; 19225#factFINAL assume true; 19223#factEXIT >#68#return; 19215#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 19220#$Ultimate##0 ~n := #in~n; 19224#L25 assume ~n <= 0;#res := 1; 19222#factFINAL assume true; 19221#factEXIT >#70#return; 19216#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 19220#$Ultimate##0 ~n := #in~n; 19224#L25 assume ~n <= 0;#res := 1; 19222#factFINAL assume true; 19221#factEXIT >#72#return; 18675#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18676#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 19397#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 19395#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18684#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18685#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18636#$Ultimate##0 ~n := #in~n; 18744#L25 assume !(~n <= 0); 18722#L26 call #t~ret0 := fact(~n - 1);< 18736#$Ultimate##0 ~n := #in~n; 18742#L25 assume ~n <= 0;#res := 1; 18745#factFINAL assume true; 18721#factEXIT >#66#return; 18720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18719#factFINAL assume true; 18717#factEXIT >#74#return; 18710#L30-6 [2023-02-14 03:08:01,886 INFO L750 eck$LassoCheckResult]: Loop: 18710#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18711#$Ultimate##0 ~n := #in~n; 18763#L25 assume !(~n <= 0); 18722#L26 call #t~ret0 := fact(~n - 1);< 18736#$Ultimate##0 ~n := #in~n; 18741#L25 assume !(~n <= 0); 18738#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18743#L25 assume ~n <= 0;#res := 1; 18754#factFINAL assume true; 18747#factEXIT >#66#return; 18746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18737#factFINAL assume true; 18739#factEXIT >#66#return; 18748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19389#factFINAL assume true; 19371#factEXIT >#76#return; 18715#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18636#$Ultimate##0 ~n := #in~n; 18744#L25 assume !(~n <= 0); 18722#L26 call #t~ret0 := fact(~n - 1);< 18736#$Ultimate##0 ~n := #in~n; 18741#L25 assume !(~n <= 0); 18738#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18743#L25 assume ~n <= 0;#res := 1; 18754#factFINAL assume true; 18747#factEXIT >#66#return; 18746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18737#factFINAL assume true; 18739#factEXIT >#66#return; 18748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19389#factFINAL assume true; 19371#factEXIT >#78#return; 18718#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 18680#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 18681#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18694#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18695#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 18635#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18636#$Ultimate##0 ~n := #in~n; 18744#L25 assume !(~n <= 0); 18722#L26 call #t~ret0 := fact(~n - 1);< 18736#$Ultimate##0 ~n := #in~n; 18741#L25 assume !(~n <= 0); 18738#L26 call #t~ret0 := fact(~n - 1);< 18740#$Ultimate##0 ~n := #in~n; 18743#L25 assume ~n <= 0;#res := 1; 18754#factFINAL assume true; 18747#factEXIT >#66#return; 18746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18737#factFINAL assume true; 18739#factEXIT >#66#return; 18748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 19389#factFINAL assume true; 19371#factEXIT >#74#return; 18710#L30-6 [2023-02-14 03:08:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1955062330, now seen corresponding path program 4 times [2023-02-14 03:08:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:01,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307199581] [2023-02-14 03:08:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:01,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:01,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228391670] [2023-02-14 03:08:01,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:08:01,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:01,893 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:01,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2023-02-14 03:08:01,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:08:01,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:01,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:01,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 192 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-14 03:08:02,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2023-02-14 03:08:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:02,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307199581] [2023-02-14 03:08:02,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228391670] [2023-02-14 03:08:02,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228391670] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:02,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:02,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 03:08:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558880109] [2023-02-14 03:08:02,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:02,124 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1442359412, now seen corresponding path program 2 times [2023-02-14 03:08:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:02,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056499666] [2023-02-14 03:08:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:02,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:02,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246922563] [2023-02-14 03:08:02,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:08:02,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:02,162 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:02,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2023-02-14 03:08:02,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:08:02,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:08:02,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:08:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:08:02,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:08:03,642 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:03,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:03,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:03,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:03,643 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:08:03,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:03,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:03,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:03,643 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-02-14 03:08:03,643 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:03,643 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:03,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,666 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,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-14 03:08:03,670 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,775 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:03,776 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:08:03,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:03,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:03,791 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-14 03:08:03,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:03,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:03,816 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-14 03:08:03,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:03,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:03,853 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-14 03:08:03,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:08:03,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:03,895 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-14 03:08:03,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:08:03,933 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-14 03:08:03,933 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:03,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:03,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:03,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:03,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:08:03,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:03,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:03,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:03,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2023-02-14 03:08:03,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:03,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:03,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,936 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,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-14 03:08:03,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-14 03:08:03,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:03,957 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:04,048 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:04,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:08:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:04,050 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-14 03:08:04,059 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-14 03:08:04,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:04,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:04,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:04,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:04,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:04,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:04,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:04,069 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-14 03:08:04,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:04,093 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-14 03:08:04,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:04,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:04,095 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-14 03:08:04,097 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-14 03:08:04,099 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-14 03:08:04,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:04,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:04,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:04,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:04,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:04,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:04,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:04,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:08:04,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:08:04,114 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:08:04,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:04,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:04,117 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-14 03:08:04,117 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-14 03:08:04,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:08:04,118 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:08:04,118 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:08:04,119 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2023-02-14 03:08:04,122 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-14 03:08:04,122 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:08:04,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:04,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 03:08:04,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:04,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 03:08:04,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 03:08:04,728 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2023-02-14 03:08:04,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:04,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 998 states and 1261 transitions. Complement of second has 49 states. [2023-02-14 03:08:04,899 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-14 03:08:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2023-02-14 03:08:04,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 93 letters. Loop has 56 letters. [2023-02-14 03:08:04,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:04,900 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:04,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 03:08:04,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:05,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 03:08:05,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 03:08:05,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2023-02-14 03:08:05,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:05,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 998 states and 1261 transitions. Complement of second has 49 states. [2023-02-14 03:08:05,812 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-14 03:08:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2023-02-14 03:08:05,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 93 letters. Loop has 56 letters. [2023-02-14 03:08:05,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:05,813 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:05,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 03:08:05,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:06,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 03:08:06,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-14 03:08:06,320 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 8 loop predicates [2023-02-14 03:08:06,321 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228 Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:06,486 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 978 transitions. cyclomatic complexity: 228. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Result 2010 states and 2525 transitions. Complement of second has 78 states. [2023-02-14 03:08:06,487 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-14 03:08:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-02-14 03:08:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2023-02-14 03:08:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 93 letters. Loop has 56 letters. [2023-02-14 03:08:06,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:06,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 149 letters. Loop has 56 letters. [2023-02-14 03:08:06,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:06,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 81 transitions. Stem has 93 letters. Loop has 112 letters. [2023-02-14 03:08:06,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:06,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2010 states and 2525 transitions. [2023-02-14 03:08:06,515 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-02-14 03:08:06,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2010 states to 1729 states and 2216 transitions. [2023-02-14 03:08:06,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2023-02-14 03:08:06,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 392 [2023-02-14 03:08:06,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1729 states and 2216 transitions. [2023-02-14 03:08:06,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:06,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1729 states and 2216 transitions. [2023-02-14 03:08:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states and 2216 transitions. [2023-02-14 03:08:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1162. [2023-02-14 03:08:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 783 states have (on average 1.08301404853129) internal successors, (848), 803 states have internal predecessors, (848), 222 states have call successors, (230), 118 states have call predecessors, (230), 157 states have return successors, (397), 240 states have call predecessors, (397), 222 states have call successors, (397) [2023-02-14 03:08:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1475 transitions. [2023-02-14 03:08:06,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1162 states and 1475 transitions. [2023-02-14 03:08:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 03:08:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 03:08:06,566 INFO L87 Difference]: Start difference. First operand 1162 states and 1475 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-14 03:08:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:06,688 INFO L93 Difference]: Finished difference Result 903 states and 1119 transitions. [2023-02-14 03:08:06,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 1119 transitions. [2023-02-14 03:08:06,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 03:08:06,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 667 states and 821 transitions. [2023-02-14 03:08:06,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2023-02-14 03:08:06,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2023-02-14 03:08:06,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 821 transitions. [2023-02-14 03:08:06,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:06,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 821 transitions. [2023-02-14 03:08:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 821 transitions. [2023-02-14 03:08:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 649. [2023-02-14 03:08:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 437 states have (on average 1.0869565217391304) internal successors, (475), 452 states have internal predecessors, (475), 116 states have call successors, (122), 72 states have call predecessors, (122), 96 states have return successors, (204), 124 states have call predecessors, (204), 116 states have call successors, (204) [2023-02-14 03:08:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 801 transitions. [2023-02-14 03:08:06,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 649 states and 801 transitions. [2023-02-14 03:08:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 03:08:06,710 INFO L428 stractBuchiCegarLoop]: Abstraction has 649 states and 801 transitions. [2023-02-14 03:08:06,710 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-14 03:08:06,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 801 transitions. [2023-02-14 03:08:06,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 03:08:06,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:06,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:06,714 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 14, 8, 8, 8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:06,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:06,714 INFO L748 eck$LassoCheckResult]: Stem: 27704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 27648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 27649#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27671#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 27705#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27933#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27931#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27928#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27929#$Ultimate##0 ~n := #in~n; 27939#L25 assume ~n <= 0;#res := 1; 27936#factFINAL assume true; 27927#factEXIT >#68#return; 27924#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27926#$Ultimate##0 ~n := #in~n; 27932#L25 assume ~n <= 0;#res := 1; 27930#factFINAL assume true; 27923#factEXIT >#70#return; 27925#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27926#$Ultimate##0 ~n := #in~n; 27932#L25 assume ~n <= 0;#res := 1; 27930#factFINAL assume true; 27923#factEXIT >#72#return; 27922#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27921#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27919#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27915#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27909#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27903#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27904#$Ultimate##0 ~n := #in~n; 27920#L25 assume !(~n <= 0); 27917#L26 call #t~ret0 := fact(~n - 1);< 27918#$Ultimate##0 ~n := #in~n; 28040#L25 assume ~n <= 0;#res := 1; 28041#factFINAL assume true; 27916#factEXIT >#66#return; 27914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27908#factFINAL assume true; 27902#factEXIT >#74#return; 27881#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27884#$Ultimate##0 ~n := #in~n; 27906#L25 assume ~n <= 0;#res := 1; 27905#factFINAL assume true; 27888#factEXIT >#76#return; 27847#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27848#$Ultimate##0 ~n := #in~n; 27862#L25 assume !(~n <= 0); 27855#L26 call #t~ret0 := fact(~n - 1);< 27860#$Ultimate##0 ~n := #in~n; 27863#L25 assume ~n <= 0;#res := 1; 27861#factFINAL assume true; 27859#factEXIT >#66#return; 27853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27849#factFINAL assume true; 27846#factEXIT >#78#return; 27650#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27651#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27672#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27715#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 27669#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 27659#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27660#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28135#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27637#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27638#$Ultimate##0 ~n := #in~n; 28054#L25 assume !(~n <= 0); 27654#L26 call #t~ret0 := fact(~n - 1);< 27656#$Ultimate##0 ~n := #in~n; 28104#L25 assume ~n <= 0;#res := 1; 28103#factFINAL assume true; 28080#factEXIT >#66#return; 28082#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28112#factFINAL assume true; 28067#factEXIT >#68#return; 28050#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27691#$Ultimate##0 ~n := #in~n; 28106#L25 assume ~n <= 0;#res := 1; 28105#factFINAL assume true; 28102#factEXIT >#70#return; 27693#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27634#$Ultimate##0 ~n := #in~n; 27696#L25 assume !(~n <= 0); 27627#L26 call #t~ret0 := fact(~n - 1);< 27739#$Ultimate##0 ~n := #in~n; 27683#L25 assume ~n <= 0;#res := 1; 27684#factFINAL assume true; 27624#factEXIT >#66#return; 27628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28118#factFINAL assume true; 28083#factEXIT >#72#return; 28079#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 28077#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 28075#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28074#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28073#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 28070#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28071#$Ultimate##0 ~n := #in~n; 28086#L25 assume !(~n <= 0); 28081#L26 call #t~ret0 := fact(~n - 1);< 27656#$Ultimate##0 ~n := #in~n; 28104#L25 assume ~n <= 0;#res := 1; 28103#factFINAL assume true; 28080#factEXIT >#66#return; 28078#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28076#factFINAL assume true; 28069#factEXIT >#68#return; 27645#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27745#$Ultimate##0 ~n := #in~n; 28052#L25 assume !(~n <= 0); 27626#L26 call #t~ret0 := fact(~n - 1);< 27739#$Ultimate##0 ~n := #in~n; 27683#L25 assume ~n <= 0;#res := 1; 27684#factFINAL assume true; 27624#factEXIT >#66#return; 27629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27641#factFINAL assume true; 27646#factEXIT >#70#return; 27643#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27745#$Ultimate##0 ~n := #in~n; 28052#L25 assume ~n <= 0;#res := 1; 28049#factFINAL assume true; 27744#factEXIT >#72#return; 27743#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27742#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 27740#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27731#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27727#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27620#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27621#$Ultimate##0 ~n := #in~n; 27741#L25 assume !(~n <= 0); 27625#L26 call #t~ret0 := fact(~n - 1);< 27739#$Ultimate##0 ~n := #in~n; 27798#L25 assume !(~n <= 0); 27735#L26 call #t~ret0 := fact(~n - 1);< 27763#$Ultimate##0 ~n := #in~n; 27796#L25 assume ~n <= 0;#res := 1; 27795#factFINAL assume true; 27794#factEXIT >#66#return; 27738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27762#factFINAL assume true; 27734#factEXIT >#66#return; 27730#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27726#factFINAL assume true; 27725#factEXIT >#74#return; 27698#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27700#$Ultimate##0 ~n := #in~n; 28033#L25 assume ~n <= 0;#res := 1; 27844#factFINAL assume true; 27712#factEXIT >#76#return; 27706#L30-7 [2023-02-14 03:08:06,714 INFO L750 eck$LassoCheckResult]: Loop: 27706#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27707#$Ultimate##0 ~n := #in~n; 27802#L25 assume !(~n <= 0); 27767#L26 call #t~ret0 := fact(~n - 1);< 27773#$Ultimate##0 ~n := #in~n; 27833#L25 assume ~n <= 0;#res := 1; 27843#factFINAL assume true; 27766#factEXIT >#66#return; 27765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27764#factFINAL assume true; 27761#factEXIT >#78#return; 27760#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 27758#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 27746#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 27732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27728#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27719#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27720#$Ultimate##0 ~n := #in~n; 27820#L25 assume !(~n <= 0); 27769#L26 call #t~ret0 := fact(~n - 1);< 27773#$Ultimate##0 ~n := #in~n; 27831#L25 assume !(~n <= 0); 27818#L26 call #t~ret0 := fact(~n - 1);< 27826#$Ultimate##0 ~n := #in~n; 27831#L25 assume !(~n <= 0); 27818#L26 call #t~ret0 := fact(~n - 1);< 27826#$Ultimate##0 ~n := #in~n; 27834#L25 assume ~n <= 0;#res := 1; 27842#factFINAL assume true; 27840#factEXIT >#66#return; 27837#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27835#factFINAL assume true; 27829#factEXIT >#66#return; 27819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27825#factFINAL assume true; 27817#factEXIT >#66#return; 27788#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 27724#factFINAL assume true; 27718#factEXIT >#74#return; 27711#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27714#$Ultimate##0 ~n := #in~n; 28032#L25 assume ~n <= 0;#res := 1; 27845#factFINAL assume true; 27710#factEXIT >#76#return; 27706#L30-7 [2023-02-14 03:08:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash -434985182, now seen corresponding path program 5 times [2023-02-14 03:08:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:06,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497874322] [2023-02-14 03:08:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:06,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:06,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187478164] [2023-02-14 03:08:06,722 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:08:06,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:06,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:06,723 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-14 03:08:06,725 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-14 03:08:06,801 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-02-14 03:08:06,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:06,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:08:06,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 329 proven. 32 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2023-02-14 03:08:06,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2023-02-14 03:08:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497874322] [2023-02-14 03:08:06,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:06,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187478164] [2023-02-14 03:08:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187478164] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:06,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:06,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-14 03:08:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592642474] [2023-02-14 03:08:06,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:06,991 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 74491038, now seen corresponding path program 3 times [2023-02-14 03:08:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:06,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100829719] [2023-02-14 03:08:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:06,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:06,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311097019] [2023-02-14 03:08:06,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:08:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,015 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-02-14 03:08:07,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-02-14 03:08:07,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:08:07,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:08:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:08:07,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:08:07,500 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:07,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:07,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:07,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:07,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:08:07,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:07,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:07,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-14 03:08:07,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:07,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:07,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,503 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,505 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,521 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,522 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:07,588 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:08:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,591 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-14 03:08:07,592 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-14 03:08:07,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:07,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:07,600 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:07,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:07,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2023-02-14 03:08:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,604 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-14 03:08:07,606 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-14 03:08:07,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:07,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:07,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:07,624 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:07,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2023-02-14 03:08:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,629 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-14 03:08:07,630 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-14 03:08:07,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:07,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:07,639 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:07,639 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:07,642 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-14 03:08:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,643 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-14 03:08:07,645 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-14 03:08:07,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:07,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:07,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:07,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,677 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-02-14 03:08:07,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:08:07,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:07,702 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:08:07,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-02-14 03:08:07,705 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:07,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:07,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:07,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:07,705 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:08:07,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:07,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:07,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2023-02-14 03:08:07,705 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:07,705 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:07,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,718 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,719 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,720 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,744 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:07,797 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:07,797 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:08:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,799 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-02-14 03:08:07,803 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-14 03:08:07,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:07,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:07,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:07,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:07,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:07,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:07,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:07,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:07,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,815 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-02-14 03:08:07,818 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-14 03:08:07,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:07,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:07,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:07,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:07,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:07,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:07,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:07,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:07,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-02-14 03:08:07,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,830 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-02-14 03:08:07,834 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-14 03:08:07,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:07,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:07,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:07,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:07,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:07,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:07,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:07,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:07,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2023-02-14 03:08:07,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,845 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:07,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-02-14 03:08:07,848 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-14 03:08:07,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:07,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:07,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:07,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:07,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:07,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:07,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:07,859 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:08:07,862 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:08:07,863 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:08:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:07,865 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-14 03:08:07,866 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-14 03:08:07,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:08:07,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:08:07,867 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:08:07,867 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 5*ULTIMATE.start_main_~x~0#1 - 6*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2023-02-14 03:08:07,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:07,870 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:08:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:08,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 03:08:08,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:08,359 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-14 03:08:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:08,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:08:08,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 03:08:08,725 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-14 03:08:08,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:08,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 1140 states and 1397 transitions. Complement of second has 59 states. [2023-02-14 03:08:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2023-02-14 03:08:08,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 03:08:08,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:08,910 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:08,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 03:08:08,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:09,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:08:09,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 03:08:09,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 03:08:09,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:10,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 1048 states and 1271 transitions. Complement of second has 55 states. [2023-02-14 03:08:10,072 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-14 03:08:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2023-02-14 03:08:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 74 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 03:08:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:10,073 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:10,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 03:08:10,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:10,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:08:10,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-14 03:08:11,006 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 11 loop predicates [2023-02-14 03:08:11,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169 Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:11,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 649 states and 801 transitions. cyclomatic complexity: 169. Second operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) Result 2207 states and 2735 transitions. Complement of second has 80 states. [2023-02-14 03:08:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-02-14 03:08:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2023-02-14 03:08:11,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 148 letters. Loop has 44 letters. [2023-02-14 03:08:11,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:11,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 192 letters. Loop has 44 letters. [2023-02-14 03:08:11,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:11,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 148 letters. Loop has 88 letters. [2023-02-14 03:08:11,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:11,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2207 states and 2735 transitions. [2023-02-14 03:08:11,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 03:08:11,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2207 states to 1670 states and 2079 transitions. [2023-02-14 03:08:11,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2023-02-14 03:08:11,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 326 [2023-02-14 03:08:11,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1670 states and 2079 transitions. [2023-02-14 03:08:11,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:11,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1670 states and 2079 transitions. [2023-02-14 03:08:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states and 2079 transitions. [2023-02-14 03:08:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 990. [2023-02-14 03:08:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 662 states have (on average 1.0996978851963746) internal successors, (728), 685 states have internal predecessors, (728), 166 states have call successors, (182), 117 states have call predecessors, (182), 162 states have return successors, (351), 187 states have call predecessors, (351), 166 states have call successors, (351) [2023-02-14 03:08:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1261 transitions. [2023-02-14 03:08:11,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 990 states and 1261 transitions. [2023-02-14 03:08:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 03:08:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 03:08:11,342 INFO L87 Difference]: Start difference. First operand 990 states and 1261 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 8 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2023-02-14 03:08:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:11,472 INFO L93 Difference]: Finished difference Result 1189 states and 1576 transitions. [2023-02-14 03:08:11,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1189 states and 1576 transitions. [2023-02-14 03:08:11,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 03:08:11,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1189 states to 1128 states and 1490 transitions. [2023-02-14 03:08:11,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 259 [2023-02-14 03:08:11,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259 [2023-02-14 03:08:11,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1490 transitions. [2023-02-14 03:08:11,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:11,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1490 transitions. [2023-02-14 03:08:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1490 transitions. [2023-02-14 03:08:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 986. [2023-02-14 03:08:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 659 states have (on average 1.1001517450682854) internal successors, (725), 682 states have internal predecessors, (725), 166 states have call successors, (181), 116 states have call predecessors, (181), 161 states have return successors, (350), 187 states have call predecessors, (350), 166 states have call successors, (350) [2023-02-14 03:08:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1256 transitions. [2023-02-14 03:08:11,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 986 states and 1256 transitions. [2023-02-14 03:08:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 03:08:11,506 INFO L428 stractBuchiCegarLoop]: Abstraction has 986 states and 1256 transitions. [2023-02-14 03:08:11,506 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-14 03:08:11,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 986 states and 1256 transitions. [2023-02-14 03:08:11,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-14 03:08:11,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:11,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:11,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:11,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:11,511 INFO L748 eck$LassoCheckResult]: Stem: 37831#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 37776#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 37797#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 37785#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 37786#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38364#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 38361#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38362#$Ultimate##0 ~n := #in~n; 38365#L25 assume ~n <= 0;#res := 1; 38363#factFINAL assume true; 38360#factEXIT >#68#return; 38355#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38357#$Ultimate##0 ~n := #in~n; 38359#L25 assume ~n <= 0;#res := 1; 38358#factFINAL assume true; 38354#factEXIT >#70#return; 38356#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38357#$Ultimate##0 ~n := #in~n; 38359#L25 assume ~n <= 0;#res := 1; 38358#factFINAL assume true; 38354#factEXIT >#72#return; 38353#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38352#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 38350#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38346#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38344#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 38339#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38341#$Ultimate##0 ~n := #in~n; 38351#L25 assume !(~n <= 0); 38348#L26 call #t~ret0 := fact(~n - 1);< 38349#$Ultimate##0 ~n := #in~n; 38374#L25 assume ~n <= 0;#res := 1; 38375#factFINAL assume true; 38347#factEXIT >#66#return; 38345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38342#factFINAL assume true; 38338#factEXIT >#74#return; 38314#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38388#$Ultimate##0 ~n := #in~n; 38328#L25 assume ~n <= 0;#res := 1; 38329#factFINAL assume true; 38313#factEXIT >#76#return; 38284#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38285#$Ultimate##0 ~n := #in~n; 38292#L25 assume !(~n <= 0); 38289#L26 call #t~ret0 := fact(~n - 1);< 38291#$Ultimate##0 ~n := #in~n; 38303#L25 assume ~n <= 0;#res := 1; 38304#factFINAL assume true; 38288#factEXIT >#66#return; 38287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38286#factFINAL assume true; 38283#factEXIT >#78#return; 38229#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37974#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37971#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37958#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 37953#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37872#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37874#$Ultimate##0 ~n := #in~n; 37927#L25 assume !(~n <= 0); 37924#L26 call #t~ret0 := fact(~n - 1);< 37945#$Ultimate##0 ~n := #in~n; 37940#L25 assume !(~n <= 0); 37925#L26 call #t~ret0 := fact(~n - 1);< 37933#$Ultimate##0 ~n := #in~n; 37937#L25 assume ~n <= 0;#res := 1; 37934#factFINAL assume true; 37935#factEXIT >#66#return; 37946#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37923#factFINAL assume true; 37926#factEXIT >#66#return; 37913#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37914#factFINAL assume true; 37871#factEXIT >#74#return; 37865#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37866#$Ultimate##0 ~n := #in~n; 37868#L25 assume ~n <= 0;#res := 1; 37867#factFINAL assume true; 37864#factEXIT >#76#return; 37846#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37847#$Ultimate##0 ~n := #in~n; 37858#L25 assume !(~n <= 0); 37852#L26 call #t~ret0 := fact(~n - 1);< 37856#$Ultimate##0 ~n := #in~n; 37859#L25 assume ~n <= 0;#res := 1; 37857#factFINAL assume true; 37850#factEXIT >#66#return; 37849#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37848#factFINAL assume true; 37845#factEXIT >#78#return; 37843#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37841#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37839#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 37836#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 37790#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37791#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 38235#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38261#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 38099#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38103#$Ultimate##0 ~n := #in~n; 38098#L25 assume !(~n <= 0); 38101#L26 call #t~ret0 := fact(~n - 1);< 37782#$Ultimate##0 ~n := #in~n; 38217#L25 assume ~n <= 0;#res := 1; 38265#factFINAL assume true; 38264#factEXIT >#66#return; 38262#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38260#factFINAL assume true; 38258#factEXIT >#68#return; 38247#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38238#$Ultimate##0 ~n := #in~n; 38259#L25 assume ~n <= 0;#res := 1; 38243#factFINAL assume true; 38250#factEXIT >#70#return; 38023#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37766#$Ultimate##0 ~n := #in~n; 38019#L25 assume !(~n <= 0); 37811#L26 call #t~ret0 := fact(~n - 1);< 37990#$Ultimate##0 ~n := #in~n; 37809#L25 assume ~n <= 0;#res := 1; 37813#factFINAL assume true; 38274#factEXIT >#66#return; 38272#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38270#factFINAL assume true; 38255#factEXIT >#72#return; 38257#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38241#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 38242#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38230#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38231#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37760#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38105#$Ultimate##0 ~n := #in~n; 38266#L25 assume !(~n <= 0); 37781#L26 call #t~ret0 := fact(~n - 1);< 37782#$Ultimate##0 ~n := #in~n; 38217#L25 assume ~n <= 0;#res := 1; 38265#factFINAL assume true; 38264#factEXIT >#66#return; 37802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37769#factFINAL assume true; 37759#factEXIT >#68#return; 37761#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37820#$Ultimate##0 ~n := #in~n; 38253#L25 assume !(~n <= 0); 37810#L26 call #t~ret0 := fact(~n - 1);< 37990#$Ultimate##0 ~n := #in~n; 37809#L25 assume ~n <= 0;#res := 1; 37813#factFINAL assume true; 38274#factEXIT >#66#return; 38275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38731#factFINAL assume true; 38281#factEXIT >#70#return; 37996#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37820#$Ultimate##0 ~n := #in~n; 38253#L25 assume ~n <= 0;#res := 1; 38254#factFINAL assume true; 38236#factEXIT >#72#return; 38232#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 38110#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 38024#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38018#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38017#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37755#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 37756#$Ultimate##0 ~n := #in~n; 37998#L25 assume !(~n <= 0); 37812#L26 call #t~ret0 := fact(~n - 1);< 37990#$Ultimate##0 ~n := #in~n; 38004#L25 assume !(~n <= 0); 37986#L26 call #t~ret0 := fact(~n - 1);< 37995#$Ultimate##0 ~n := #in~n; 38005#L25 assume ~n <= 0;#res := 1; 38008#factFINAL assume true; 38003#factEXIT >#66#return; 37987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37994#factFINAL assume true; 37985#factEXIT >#66#return; 37979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37980#factFINAL assume true; 37975#factEXIT >#74#return; 37825#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 37827#$Ultimate##0 ~n := #in~n; 38051#L25 assume ~n <= 0;#res := 1; 38030#factFINAL assume true; 38025#factEXIT >#76#return; 37956#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 38194#$Ultimate##0 ~n := #in~n; 37972#L25 assume !(~n <= 0); 37962#L26 call #t~ret0 := fact(~n - 1);< 37970#$Ultimate##0 ~n := #in~n; 38002#L25 assume ~n <= 0;#res := 1; 38037#factFINAL assume true; 37959#factEXIT >#66#return; 37955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37957#factFINAL assume true; 38220#factEXIT >#78#return; 37777#L30-8 [2023-02-14 03:08:11,511 INFO L750 eck$LassoCheckResult]: Loop: 37777#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 37778#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 37798#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 38011#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 38009#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 37977#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 38006#$Ultimate##0 ~n := #in~n; 37997#L25 assume !(~n <= 0); 37960#L26 call #t~ret0 := fact(~n - 1);< 37970#$Ultimate##0 ~n := #in~n; 37999#L25 assume !(~n <= 0); 37982#L26 call #t~ret0 := fact(~n - 1);< 37993#$Ultimate##0 ~n := #in~n; 37999#L25 assume !(~n <= 0); 37982#L26 call #t~ret0 := fact(~n - 1);< 37993#$Ultimate##0 ~n := #in~n; 37999#L25 assume !(~n <= 0); 37982#L26 call #t~ret0 := fact(~n - 1);< 37993#$Ultimate##0 ~n := #in~n; 38001#L25 assume ~n <= 0;#res := 1; 38016#factFINAL assume true; 38015#factEXIT >#66#return; 38014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38013#factFINAL assume true; 38012#factEXIT >#66#return; 38010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 38007#factFINAL assume true; 38000#factEXIT >#66#return; 37984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37991#factFINAL assume true; 37981#factEXIT >#66#return; 37983#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37976#factFINAL assume true; 37978#factEXIT >#74#return; 37992#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 38055#$Ultimate##0 ~n := #in~n; 38043#L25 assume ~n <= 0;#res := 1; 38044#factFINAL assume true; 38213#factEXIT >#76#return; 37832#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 37833#$Ultimate##0 ~n := #in~n; 37973#L25 assume !(~n <= 0); 37963#L26 call #t~ret0 := fact(~n - 1);< 37970#$Ultimate##0 ~n := #in~n; 38002#L25 assume ~n <= 0;#res := 1; 38037#factFINAL assume true; 37959#factEXIT >#66#return; 37967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 37952#factFINAL assume true; 37950#factEXIT >#78#return; 37777#L30-8 [2023-02-14 03:08:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1839695170, now seen corresponding path program 6 times [2023-02-14 03:08:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:11,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496459479] [2023-02-14 03:08:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:11,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:11,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495698731] [2023-02-14 03:08:11,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:08:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:11,520 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:11,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2023-02-14 03:08:11,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-14 03:08:11,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:11,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:11,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 367 proven. 4 refuted. 0 times theorem prover too weak. 1574 trivial. 0 not checked. [2023-02-14 03:08:11,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 121 proven. 10 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2023-02-14 03:08:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:11,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496459479] [2023-02-14 03:08:11,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:11,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495698731] [2023-02-14 03:08:11,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495698731] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:11,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:11,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 03:08:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49979293] [2023-02-14 03:08:11,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:11,895 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1984687932, now seen corresponding path program 4 times [2023-02-14 03:08:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854855852] [2023-02-14 03:08:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:11,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:11,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805686375] [2023-02-14 03:08:11,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:08:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:11,923 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2023-02-14 03:08:11,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:08:11,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:11,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 03:08:11,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 35 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-14 03:08:12,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 33 proven. 65 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-14 03:08:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:12,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854855852] [2023-02-14 03:08:12,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:12,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805686375] [2023-02-14 03:08:12,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805686375] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:12,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:12,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2023-02-14 03:08:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909322499] [2023-02-14 03:08:12,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:12,523 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:08:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 03:08:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-02-14 03:08:12,524 INFO L87 Difference]: Start difference. First operand 986 states and 1256 transitions. cyclomatic complexity: 297 Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (15), 10 states have call predecessors, (15), 12 states have call successors, (15) [2023-02-14 03:08:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:13,110 INFO L93 Difference]: Finished difference Result 2130 states and 2989 transitions. [2023-02-14 03:08:13,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2130 states and 2989 transitions. [2023-02-14 03:08:13,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2023-02-14 03:08:13,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2130 states to 2071 states and 2920 transitions. [2023-02-14 03:08:13,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2023-02-14 03:08:13,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 448 [2023-02-14 03:08:13,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2071 states and 2920 transitions. [2023-02-14 03:08:13,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:13,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2071 states and 2920 transitions. [2023-02-14 03:08:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states and 2920 transitions. [2023-02-14 03:08:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1433. [2023-02-14 03:08:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 922 states have (on average 1.0704989154013016) internal successors, (987), 951 states have internal predecessors, (987), 272 states have call successors, (297), 186 states have call predecessors, (297), 239 states have return successors, (695), 295 states have call predecessors, (695), 272 states have call successors, (695) [2023-02-14 03:08:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1979 transitions. [2023-02-14 03:08:13,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1433 states and 1979 transitions. [2023-02-14 03:08:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 03:08:13,181 INFO L428 stractBuchiCegarLoop]: Abstraction has 1433 states and 1979 transitions. [2023-02-14 03:08:13,182 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-14 03:08:13,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1433 states and 1979 transitions. [2023-02-14 03:08:13,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-02-14 03:08:13,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:13,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:13,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [37, 37, 19, 19, 19, 19, 18, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:13,188 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:13,188 INFO L748 eck$LassoCheckResult]: Stem: 42473#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 42419#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42420#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 42443#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 42474#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42632#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42630#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42627#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42628#$Ultimate##0 ~n := #in~n; 42631#L25 assume ~n <= 0;#res := 1; 42629#factFINAL assume true; 42626#factEXIT >#68#return; 42621#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42623#$Ultimate##0 ~n := #in~n; 42625#L25 assume ~n <= 0;#res := 1; 42624#factFINAL assume true; 42620#factEXIT >#70#return; 42622#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42623#$Ultimate##0 ~n := #in~n; 42625#L25 assume ~n <= 0;#res := 1; 42624#factFINAL assume true; 42620#factEXIT >#72#return; 42619#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42618#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 42617#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42616#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42615#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42613#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42614#$Ultimate##0 ~n := #in~n; 42717#L25 assume !(~n <= 0); 42713#L26 call #t~ret0 := fact(~n - 1);< 42716#$Ultimate##0 ~n := #in~n; 42721#L25 assume ~n <= 0;#res := 1; 42784#factFINAL assume true; 42782#factEXIT >#66#return; 42783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42861#factFINAL assume true; 42612#factEXIT >#74#return; 42603#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42608#$Ultimate##0 ~n := #in~n; 42610#L25 assume ~n <= 0;#res := 1; 42609#factFINAL assume true; 42601#factEXIT >#76#return; 42586#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42592#$Ultimate##0 ~n := #in~n; 42736#L25 assume !(~n <= 0); 42642#L26 call #t~ret0 := fact(~n - 1);< 42667#$Ultimate##0 ~n := #in~n; 42860#L25 assume ~n <= 0;#res := 1; 42859#factFINAL assume true; 42857#factEXIT >#66#return; 42858#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42866#factFINAL assume true; 42589#factEXIT >#78#return; 42584#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42582#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42580#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42578#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42500#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42497#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42538#$Ultimate##0 ~n := #in~n; 42539#L25 assume !(~n <= 0); 42507#L26 call #t~ret0 := fact(~n - 1);< 42509#$Ultimate##0 ~n := #in~n; 42571#L25 assume !(~n <= 0); 42506#L26 call #t~ret0 := fact(~n - 1);< 42569#$Ultimate##0 ~n := #in~n; 42571#L25 assume !(~n <= 0); 42506#L26 call #t~ret0 := fact(~n - 1);< 42569#$Ultimate##0 ~n := #in~n; 42572#L25 assume ~n <= 0;#res := 1; 42570#factFINAL assume true; 42568#factEXIT >#66#return; 42565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42566#factFINAL assume true; 42553#factEXIT >#66#return; 42549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42550#factFINAL assume true; 42505#factEXIT >#66#return; 42508#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42496#factFINAL assume true; 42498#factEXIT >#74#return; 42486#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42489#$Ultimate##0 ~n := #in~n; 42491#L25 assume ~n <= 0;#res := 1; 42490#factFINAL assume true; 42485#factEXIT >#76#return; 42483#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42484#$Ultimate##0 ~n := #in~n; 42525#L25 assume !(~n <= 0); 42514#L26 call #t~ret0 := fact(~n - 1);< 42523#$Ultimate##0 ~n := #in~n; 42559#L25 assume !(~n <= 0); 42511#L26 call #t~ret0 := fact(~n - 1);< 42556#$Ultimate##0 ~n := #in~n; 42560#L25 assume ~n <= 0;#res := 1; 42557#factFINAL assume true; 42555#factEXIT >#66#return; 42551#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42552#factFINAL assume true; 42520#factEXIT >#66#return; 42504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42499#factFINAL assume true; 42482#factEXIT >#78#return; 42481#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42480#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42479#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 42478#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 42441#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42431#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42433#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42996#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42990#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42992#$Ultimate##0 ~n := #in~n; 43006#L25 assume !(~n <= 0); 43000#L26 call #t~ret0 := fact(~n - 1);< 43002#$Ultimate##0 ~n := #in~n; 43008#L25 assume ~n <= 0;#res := 1; 43004#factFINAL assume true; 42998#factEXIT >#66#return; 42995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42993#factFINAL assume true; 42989#factEXIT >#68#return; 42974#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42985#$Ultimate##0 ~n := #in~n; 42987#L25 assume ~n <= 0;#res := 1; 42986#factFINAL assume true; 42967#factEXIT >#70#return; 42981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43017#$Ultimate##0 ~n := #in~n; 43033#L25 assume !(~n <= 0); 42942#L26 call #t~ret0 := fact(~n - 1);< 42920#$Ultimate##0 ~n := #in~n; 43041#L25 assume ~n <= 0;#res := 1; 43040#factFINAL assume true; 43029#factEXIT >#66#return; 43026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43025#factFINAL assume true; 43023#factEXIT >#72#return; 43022#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43021#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43020#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43019#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43018#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43005#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43011#$Ultimate##0 ~n := #in~n; 43009#L25 assume !(~n <= 0); 42999#L26 call #t~ret0 := fact(~n - 1);< 43002#$Ultimate##0 ~n := #in~n; 43008#L25 assume ~n <= 0;#res := 1; 43004#factFINAL assume true; 42998#factEXIT >#66#return; 43001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43067#factFINAL assume true; 43066#factEXIT >#68#return; 42919#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42400#$Ultimate##0 ~n := #in~n; 43060#L25 assume !(~n <= 0); 42918#L26 call #t~ret0 := fact(~n - 1);< 42920#$Ultimate##0 ~n := #in~n; 43041#L25 assume ~n <= 0;#res := 1; 43040#factFINAL assume true; 43029#factEXIT >#66#return; 43030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43820#factFINAL assume true; 43065#factEXIT >#70#return; 42399#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42400#$Ultimate##0 ~n := #in~n; 43060#L25 assume ~n <= 0;#res := 1; 43075#factFINAL assume true; 43074#factEXIT >#72#return; 42980#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43073#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43071#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43069#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42965#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42395#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42396#$Ultimate##0 ~n := #in~n; 42890#L25 assume !(~n <= 0); 42891#L26 call #t~ret0 := fact(~n - 1);< 42920#$Ultimate##0 ~n := #in~n; 42939#L25 assume !(~n <= 0); 42932#L26 call #t~ret0 := fact(~n - 1);< 42938#$Ultimate##0 ~n := #in~n; 42939#L25 assume !(~n <= 0); 42932#L26 call #t~ret0 := fact(~n - 1);< 42938#$Ultimate##0 ~n := #in~n; 42939#L25 assume !(~n <= 0); 42932#L26 call #t~ret0 := fact(~n - 1);< 42938#$Ultimate##0 ~n := #in~n; 42935#L25 assume ~n <= 0;#res := 1; 42931#factFINAL assume true; 42933#factEXIT >#66#return; 43055#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43050#factFINAL assume true; 43051#factEXIT >#66#return; 43053#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43054#factFINAL assume true; 43046#factEXIT >#66#return; 43037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43061#factFINAL assume true; 43035#factEXIT >#66#return; 43038#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43048#factFINAL assume true; 43049#factEXIT >#74#return; 42426#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42468#$Ultimate##0 ~n := #in~n; 43062#L25 assume ~n <= 0;#res := 1; 43058#factFINAL assume true; 43059#factEXIT >#76#return; 42964#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 42966#$Ultimate##0 ~n := #in~n; 42963#L25 assume !(~n <= 0); 42881#L26 call #t~ret0 := fact(~n - 1);< 42957#$Ultimate##0 ~n := #in~n; 42950#L25 assume !(~n <= 0); 42879#L26 call #t~ret0 := fact(~n - 1);< 42930#$Ultimate##0 ~n := #in~n; 42960#L25 assume !(~n <= 0); 42874#L26 call #t~ret0 := fact(~n - 1);< 42941#$Ultimate##0 ~n := #in~n; 42926#L25 assume !(~n <= 0); 42871#L26 call #t~ret0 := fact(~n - 1);< 42952#$Ultimate##0 ~n := #in~n; 42959#L25 assume ~n <= 0;#res := 1; 42958#factFINAL assume true; 42951#factEXIT >#66#return; 42945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42944#factFINAL assume true; 42940#factEXIT >#66#return; 42936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42937#factFINAL assume true; 42927#factEXIT >#66#return; 42884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42917#factFINAL assume true; 42868#factEXIT >#66#return; 42882#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43086#factFINAL assume true; 43089#factEXIT >#78#return; 42421#L30-8 [2023-02-14 03:08:13,189 INFO L750 eck$LassoCheckResult]: Loop: 42421#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 42422#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 42444#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43082#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 42476#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42477#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42892#$Ultimate##0 ~n := #in~n; 42893#L25 assume !(~n <= 0); 42872#L26 call #t~ret0 := fact(~n - 1);< 42889#$Ultimate##0 ~n := #in~n; 42926#L25 assume !(~n <= 0); 42871#L26 call #t~ret0 := fact(~n - 1);< 42952#$Ultimate##0 ~n := #in~n; 42926#L25 assume !(~n <= 0); 42871#L26 call #t~ret0 := fact(~n - 1);< 42952#$Ultimate##0 ~n := #in~n; 42926#L25 assume !(~n <= 0); 42871#L26 call #t~ret0 := fact(~n - 1);< 42952#$Ultimate##0 ~n := #in~n; 42959#L25 assume ~n <= 0;#res := 1; 42958#factFINAL assume true; 42951#factEXIT >#66#return; 42945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42944#factFINAL assume true; 42940#factEXIT >#66#return; 42936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42937#factFINAL assume true; 42927#factEXIT >#66#return; 42884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42917#factFINAL assume true; 42868#factEXIT >#66#return; 42885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43052#factFINAL assume true; 42495#factEXIT >#74#return; 42404#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43063#$Ultimate##0 ~n := #in~n; 43064#L25 assume ~n <= 0;#res := 1; 43085#factFINAL assume true; 43045#factEXIT >#76#return; 42961#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43042#$Ultimate##0 ~n := #in~n; 43355#L25 assume !(~n <= 0); 42875#L26 call #t~ret0 := fact(~n - 1);< 42957#$Ultimate##0 ~n := #in~n; 42950#L25 assume !(~n <= 0); 42879#L26 call #t~ret0 := fact(~n - 1);< 42930#$Ultimate##0 ~n := #in~n; 42960#L25 assume !(~n <= 0); 42874#L26 call #t~ret0 := fact(~n - 1);< 42941#$Ultimate##0 ~n := #in~n; 42926#L25 assume !(~n <= 0); 42871#L26 call #t~ret0 := fact(~n - 1);< 42952#$Ultimate##0 ~n := #in~n; 42959#L25 assume ~n <= 0;#res := 1; 42958#factFINAL assume true; 42951#factEXIT >#66#return; 42945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42944#factFINAL assume true; 42940#factEXIT >#66#return; 42936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42937#factFINAL assume true; 42927#factEXIT >#66#return; 42884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 42917#factFINAL assume true; 42868#factEXIT >#66#return; 42883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43090#factFINAL assume true; 43083#factEXIT >#78#return; 42421#L30-8 [2023-02-14 03:08:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1000684038, now seen corresponding path program 7 times [2023-02-14 03:08:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:13,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532666516] [2023-02-14 03:08:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:13,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:13,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039303140] [2023-02-14 03:08:13,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 03:08:13,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:13,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:13,227 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:13,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2023-02-14 03:08:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:13,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:08:13,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3079 backedges. 1485 proven. 13 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2023-02-14 03:08:13,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3079 backedges. 145 proven. 326 refuted. 0 times theorem prover too weak. 2608 trivial. 0 not checked. [2023-02-14 03:08:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532666516] [2023-02-14 03:08:13,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039303140] [2023-02-14 03:08:13,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039303140] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:13,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:13,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2023-02-14 03:08:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3079798] [2023-02-14 03:08:13,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:13,705 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 5 times [2023-02-14 03:08:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:13,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149920777] [2023-02-14 03:08:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:13,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990166568] [2023-02-14 03:08:13,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:08:13,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:13,711 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2023-02-14 03:08:13,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2023-02-14 03:08:13,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:08:13,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:08:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:08:13,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:08:14,677 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:14,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:14,677 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:14,677 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:14,677 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:08:14,677 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,677 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:14,677 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:14,677 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2023-02-14 03:08:14,677 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:14,677 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:14,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,682 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,684 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,685 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:14,822 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:08:14,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,825 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-14 03:08:14,826 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-14 03:08:14,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:14,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:14,837 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:14,840 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-14 03:08:14,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,842 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-14 03:08:14,844 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-14 03:08:14,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:14,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:14,854 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:14,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2023-02-14 03:08:14,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,859 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-14 03:08:14,861 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-14 03:08:14,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:14,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,871 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:14,871 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:14,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2023-02-14 03:08:14,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,876 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:14,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2023-02-14 03:08:14,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:14,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,885 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:14,886 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:14,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,890 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:14,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-02-14 03:08:14,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:14,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:14,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:14,907 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:14,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-02-14 03:08:14,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:08:14,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:14,924 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:08:14,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:14,929 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:14,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:14,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:14,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:14,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:08:14,929 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:14,929 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:14,929 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:14,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2023-02-14 03:08:14,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:14,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:14,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,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-14 03:08:14,959 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:14,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-14 03:08:14,989 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:15,103 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:15,103 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:08:15,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:15,105 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:15,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-02-14 03:08:15,109 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-14 03:08:15,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:15,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:15,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:15,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:15,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:15,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:15,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:15,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:15,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:15,124 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:15,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-02-14 03:08:15,128 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-14 03:08:15,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:15,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:15,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:15,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:15,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:15,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:15,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:15,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:15,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:15,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:15,140 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:15,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2023-02-14 03:08:15,144 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-14 03:08:15,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:15,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:15,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:15,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:15,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:15,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:15,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:15,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:15,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:15,155 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2023-02-14 03:08:15,159 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-14 03:08:15,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:15,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:15,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:15,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:15,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:15,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:15,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:15,173 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:08:15,177 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-14 03:08:15,177 INFO L444 ModelExtractionUtils]: 7 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-14 03:08:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:15,179 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:15,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2023-02-14 03:08:15,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:08:15,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:08:15,183 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:08:15,183 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2023-02-14 03:08:15,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:15,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:08:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:15,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 03:08:15,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:16,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:16,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 03:08:16,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 03:08:16,673 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-14 03:08:16,673 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:16,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2079 states and 2822 transitions. Complement of second has 53 states. [2023-02-14 03:08:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2023-02-14 03:08:16,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 79 transitions. Stem has 239 letters. Loop has 68 letters. [2023-02-14 03:08:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:16,909 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:17,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 03:08:17,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:18,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 03:08:18,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 03:08:18,467 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2023-02-14 03:08:18,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:18,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 2080 states and 2801 transitions. Complement of second has 51 states. [2023-02-14 03:08:18,721 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-14 03:08:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2023-02-14 03:08:18,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 78 transitions. Stem has 239 letters. Loop has 68 letters. [2023-02-14 03:08:18,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:18,722 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:18,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-14 03:08:18,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:19,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 03:08:19,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-02-14 03:08:20,158 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 11 loop predicates [2023-02-14 03:08:20,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:20,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1433 states and 1979 transitions. cyclomatic complexity: 573. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 4139 states and 5835 transitions. Complement of second has 71 states. [2023-02-14 03:08:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2023-02-14 03:08:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 98 transitions. [2023-02-14 03:08:20,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 239 letters. Loop has 68 letters. [2023-02-14 03:08:20,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:20,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 307 letters. Loop has 68 letters. [2023-02-14 03:08:20,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:20,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 98 transitions. Stem has 239 letters. Loop has 136 letters. [2023-02-14 03:08:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:20,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4139 states and 5835 transitions. [2023-02-14 03:08:20,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-02-14 03:08:20,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4139 states to 3074 states and 4334 transitions. [2023-02-14 03:08:20,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2023-02-14 03:08:20,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 423 [2023-02-14 03:08:20,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3074 states and 4334 transitions. [2023-02-14 03:08:20,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:20,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3074 states and 4334 transitions. [2023-02-14 03:08:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states and 4334 transitions. [2023-02-14 03:08:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2240. [2023-02-14 03:08:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 1446 states have (on average 1.0733056708160442) internal successors, (1552), 1485 states have internal predecessors, (1552), 397 states have call successors, (433), 302 states have call predecessors, (433), 397 states have return successors, (1128), 452 states have call predecessors, (1128), 397 states have call successors, (1128) [2023-02-14 03:08:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3113 transitions. [2023-02-14 03:08:20,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2240 states and 3113 transitions. [2023-02-14 03:08:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:20,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 03:08:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-14 03:08:20,598 INFO L87 Difference]: Start difference. First operand 2240 states and 3113 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (25), 2 states have call predecessors, (25), 5 states have return successors, (26), 7 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-14 03:08:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:20,887 INFO L93 Difference]: Finished difference Result 2674 states and 3810 transitions. [2023-02-14 03:08:20,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2674 states and 3810 transitions. [2023-02-14 03:08:20,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-02-14 03:08:20,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2674 states to 2560 states and 3664 transitions. [2023-02-14 03:08:20,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2023-02-14 03:08:20,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2023-02-14 03:08:20,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2560 states and 3664 transitions. [2023-02-14 03:08:20,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:20,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2560 states and 3664 transitions. [2023-02-14 03:08:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states and 3664 transitions. [2023-02-14 03:08:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2151. [2023-02-14 03:08:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 1383 states have (on average 1.0737527114967462) internal successors, (1485), 1423 states have internal predecessors, (1485), 392 states have call successors, (422), 282 states have call predecessors, (422), 376 states have return successors, (1098), 445 states have call predecessors, (1098), 392 states have call successors, (1098) [2023-02-14 03:08:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 3005 transitions. [2023-02-14 03:08:20,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2151 states and 3005 transitions. [2023-02-14 03:08:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 03:08:20,990 INFO L428 stractBuchiCegarLoop]: Abstraction has 2151 states and 3005 transitions. [2023-02-14 03:08:20,990 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-14 03:08:20,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2151 states and 3005 transitions. [2023-02-14 03:08:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2023-02-14 03:08:20,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:20,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:20,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:20,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:20,997 INFO L748 eck$LassoCheckResult]: Stem: 61600#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 61544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 61545#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 61567#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 61601#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 62128#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62126#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 62123#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62124#$Ultimate##0 ~n := #in~n; 62127#L25 assume ~n <= 0;#res := 1; 62125#factFINAL assume true; 62122#factEXIT >#68#return; 62117#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62119#$Ultimate##0 ~n := #in~n; 62121#L25 assume ~n <= 0;#res := 1; 62120#factFINAL assume true; 62116#factEXIT >#70#return; 62118#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62119#$Ultimate##0 ~n := #in~n; 62121#L25 assume ~n <= 0;#res := 1; 62120#factFINAL assume true; 62116#factEXIT >#72#return; 62115#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 62114#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 62113#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62112#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62111#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 62109#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62110#$Ultimate##0 ~n := #in~n; 62138#L25 assume !(~n <= 0); 62134#L26 call #t~ret0 := fact(~n - 1);< 62137#$Ultimate##0 ~n := #in~n; 62141#L25 assume ~n <= 0;#res := 1; 62139#factFINAL assume true; 62140#factEXIT >#66#return; 62131#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62132#factFINAL assume true; 62108#factEXIT >#74#return; 62102#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62105#$Ultimate##0 ~n := #in~n; 62107#L25 assume ~n <= 0;#res := 1; 62106#factFINAL assume true; 62101#factEXIT >#76#return; 62077#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62078#$Ultimate##0 ~n := #in~n; 62638#L25 assume !(~n <= 0); 62633#L26 call #t~ret0 := fact(~n - 1);< 62661#$Ultimate##0 ~n := #in~n; 62659#L25 assume ~n <= 0;#res := 1; 62660#factFINAL assume true; 62664#factEXIT >#66#return; 62663#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62662#factFINAL assume true; 62076#factEXIT >#78#return; 62075#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 62074#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 62073#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62072#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62071#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 61641#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61642#$Ultimate##0 ~n := #in~n; 61756#L25 assume !(~n <= 0); 61757#L26 call #t~ret0 := fact(~n - 1);< 61781#$Ultimate##0 ~n := #in~n; 61776#L25 assume !(~n <= 0); 61764#L26 call #t~ret0 := fact(~n - 1);< 61769#$Ultimate##0 ~n := #in~n; 61773#L25 assume ~n <= 0;#res := 1; 61770#factFINAL assume true; 61771#factEXIT >#66#return; 61782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61763#factFINAL assume true; 61765#factEXIT >#66#return; 61785#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61646#factFINAL assume true; 61647#factEXIT >#74#return; 61629#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61630#$Ultimate##0 ~n := #in~n; 61636#L25 assume ~n <= 0;#res := 1; 61631#factFINAL assume true; 61633#factEXIT >#76#return; 61617#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61702#$Ultimate##0 ~n := #in~n; 61701#L25 assume !(~n <= 0); 61668#L26 call #t~ret0 := fact(~n - 1);< 61688#$Ultimate##0 ~n := #in~n; 61704#L25 assume !(~n <= 0); 61669#L26 call #t~ret0 := fact(~n - 1);< 61744#$Ultimate##0 ~n := #in~n; 61746#L25 assume ~n <= 0;#res := 1; 61745#factFINAL assume true; 61743#factEXIT >#66#return; 61742#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61741#factFINAL assume true; 61666#factEXIT >#66#return; 61648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61625#factFINAL assume true; 61616#factEXIT >#78#return; 61546#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 61547#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 61610#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61608#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 61565#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 61555#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 61557#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62687#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 62684#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62685#$Ultimate##0 ~n := #in~n; 62697#L25 assume !(~n <= 0); 62691#L26 call #t~ret0 := fact(~n - 1);< 62694#$Ultimate##0 ~n := #in~n; 62699#L25 assume ~n <= 0;#res := 1; 62696#factFINAL assume true; 62690#factEXIT >#66#return; 62688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62686#factFINAL assume true; 62682#factEXIT >#68#return; 62606#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61584#$Ultimate##0 ~n := #in~n; 62628#L25 assume ~n <= 0;#res := 1; 62605#factFINAL assume true; 62618#factEXIT >#70#return; 62193#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62626#$Ultimate##0 ~n := #in~n; 62189#L25 assume !(~n <= 0); 61650#L26 call #t~ret0 := fact(~n - 1);< 61659#$Ultimate##0 ~n := #in~n; 62712#L25 assume ~n <= 0;#res := 1; 62711#factFINAL assume true; 62709#factEXIT >#66#return; 62707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62706#factFINAL assume true; 62704#factEXIT >#72#return; 62703#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 62701#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61597#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61598#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61572#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 61536#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61537#$Ultimate##0 ~n := #in~n; 62700#L25 assume !(~n <= 0); 62692#L26 call #t~ret0 := fact(~n - 1);< 62694#$Ultimate##0 ~n := #in~n; 62699#L25 assume ~n <= 0;#res := 1; 62696#factFINAL assume true; 62690#factEXIT >#66#return; 62693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62748#factFINAL assume true; 62747#factEXIT >#68#return; 62278#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62627#$Ultimate##0 ~n := #in~n; 62620#L25 assume !(~n <= 0); 61655#L26 call #t~ret0 := fact(~n - 1);< 61659#$Ultimate##0 ~n := #in~n; 62712#L25 assume ~n <= 0;#res := 1; 62711#factFINAL assume true; 62709#factEXIT >#66#return; 62710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62818#factFINAL assume true; 62631#factEXIT >#70#return; 62281#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62627#$Ultimate##0 ~n := #in~n; 62620#L25 assume ~n <= 0;#res := 1; 62621#factFINAL assume true; 62601#factEXIT >#72#return; 62602#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 62746#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 62745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 62273#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 62274#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 61522#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61523#$Ultimate##0 ~n := #in~n; 61663#L25 assume !(~n <= 0); 61652#L26 call #t~ret0 := fact(~n - 1);< 61659#$Ultimate##0 ~n := #in~n; 62168#L25 assume !(~n <= 0); 61651#L26 call #t~ret0 := fact(~n - 1);< 62150#$Ultimate##0 ~n := #in~n; 62165#L25 assume ~n <= 0;#res := 1; 62166#factFINAL assume true; 62149#factEXIT >#66#return; 61963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61797#factFINAL assume true; 61649#factEXIT >#66#return; 61645#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61637#factFINAL assume true; 61638#factEXIT >#74#return; 61550#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61594#$Ultimate##0 ~n := #in~n; 62743#L25 assume ~n <= 0;#res := 1; 62741#factFINAL assume true; 62740#factEXIT >#76#return; 62312#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 62313#$Ultimate##0 ~n := #in~n; 62781#L25 assume !(~n <= 0); 62761#L26 call #t~ret0 := fact(~n - 1);< 62784#$Ultimate##0 ~n := #in~n; 62783#L25 assume !(~n <= 0); 62758#L26 call #t~ret0 := fact(~n - 1);< 62778#$Ultimate##0 ~n := #in~n; 62780#L25 assume ~n <= 0;#res := 1; 62779#factFINAL assume true; 62777#factEXIT >#66#return; 62775#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62774#factFINAL assume true; 62772#factEXIT >#66#return; 62768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62725#factFINAL assume true; 62726#factEXIT >#78#return; 62303#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 61568#binomialCoefficient_returnLabel#2 [2023-02-14 03:08:20,997 INFO L750 eck$LassoCheckResult]: Loop: 61568#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 61569#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61644#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 61661#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 62216#$Ultimate##0 ~n := #in~n; 61660#L25 assume !(~n <= 0); 61662#L26 call #t~ret0 := fact(~n - 1);< 62179#$Ultimate##0 ~n := #in~n; 62188#L25 assume !(~n <= 0); 62161#L26 call #t~ret0 := fact(~n - 1);< 62210#$Ultimate##0 ~n := #in~n; 62188#L25 assume !(~n <= 0); 62161#L26 call #t~ret0 := fact(~n - 1);< 62210#$Ultimate##0 ~n := #in~n; 62188#L25 assume !(~n <= 0); 62161#L26 call #t~ret0 := fact(~n - 1);< 62210#$Ultimate##0 ~n := #in~n; 62188#L25 assume !(~n <= 0); 62161#L26 call #t~ret0 := fact(~n - 1);< 62210#$Ultimate##0 ~n := #in~n; 62221#L25 assume ~n <= 0;#res := 1; 62220#factFINAL assume true; 62209#factEXIT >#66#return; 62201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62199#factFINAL assume true; 62196#factEXIT >#66#return; 62180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62176#factFINAL assume true; 62169#factEXIT >#66#return; 62167#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62151#factFINAL assume true; 62162#factEXIT >#66#return; 62255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62256#factFINAL assume true; 62253#factEXIT >#66#return; 62249#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62247#factFINAL assume true; 62215#factEXIT >#74#return; 62203#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 62206#$Ultimate##0 ~n := #in~n; 62212#L25 assume !(~n <= 0); 62160#L26 call #t~ret0 := fact(~n - 1);< 62179#$Ultimate##0 ~n := #in~n; 62188#L25 assume !(~n <= 0); 62161#L26 call #t~ret0 := fact(~n - 1);< 62210#$Ultimate##0 ~n := #in~n; 62221#L25 assume ~n <= 0;#res := 1; 62220#factFINAL assume true; 62209#factEXIT >#66#return; 62201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62199#factFINAL assume true; 62196#factEXIT >#66#return; 62174#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62341#factFINAL assume true; 62342#factEXIT >#76#return; 61602#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61603#$Ultimate##0 ~n := #in~n; 62319#L25 assume !(~n <= 0); 62154#L26 call #t~ret0 := fact(~n - 1);< 62179#$Ultimate##0 ~n := #in~n; 62348#L25 assume ~n <= 0;#res := 1; 62347#factFINAL assume true; 62343#factEXIT >#66#return; 62344#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 62625#factFINAL assume true; 61624#factEXIT >#78#return; 61615#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 61568#binomialCoefficient_returnLabel#2 [2023-02-14 03:08:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 794210609, now seen corresponding path program 8 times [2023-02-14 03:08:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:20,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693883345] [2023-02-14 03:08:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:21,004 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:21,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952727234] [2023-02-14 03:08:21,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:08:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:21,006 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:21,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2023-02-14 03:08:21,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:08:21,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:21,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 03:08:21,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 522 proven. 4 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2023-02-14 03:08:21,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 126 proven. 13 refuted. 0 times theorem prover too weak. 2102 trivial. 0 not checked. [2023-02-14 03:08:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693883345] [2023-02-14 03:08:21,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952727234] [2023-02-14 03:08:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952727234] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:21,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:21,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-02-14 03:08:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494659751] [2023-02-14 03:08:21,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:21,320 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1717509474, now seen corresponding path program 6 times [2023-02-14 03:08:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:21,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809437750] [2023-02-14 03:08:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:21,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208804392] [2023-02-14 03:08:21,325 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:08:21,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:21,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:21,326 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:21,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2023-02-14 03:08:21,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-14 03:08:21,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:21,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 03:08:21,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 62 proven. 125 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-14 03:08:21,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 61 proven. 149 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-14 03:08:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809437750] [2023-02-14 03:08:22,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208804392] [2023-02-14 03:08:22,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208804392] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:22,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:22,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 24 [2023-02-14 03:08:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117105403] [2023-02-14 03:08:22,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:22,225 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:08:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:08:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 03:08:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-02-14 03:08:22,226 INFO L87 Difference]: Start difference. First operand 2151 states and 3005 transitions. cyclomatic complexity: 896 Second operand has 24 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (19), 12 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-14 03:08:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:08:23,044 INFO L93 Difference]: Finished difference Result 4047 states and 6495 transitions. [2023-02-14 03:08:23,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4047 states and 6495 transitions. [2023-02-14 03:08:23,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2023-02-14 03:08:23,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4047 states to 3976 states and 6398 transitions. [2023-02-14 03:08:23,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2023-02-14 03:08:23,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2023-02-14 03:08:23,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3976 states and 6398 transitions. [2023-02-14 03:08:23,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:08:23,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3976 states and 6398 transitions. [2023-02-14 03:08:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states and 6398 transitions. [2023-02-14 03:08:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 2334. [2023-02-14 03:08:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 1490 states have (on average 1.0684563758389263) internal successors, (1592), 1527 states have internal predecessors, (1592), 433 states have call successors, (467), 302 states have call predecessors, (467), 411 states have return successors, (1388), 504 states have call predecessors, (1388), 433 states have call successors, (1388) [2023-02-14 03:08:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3447 transitions. [2023-02-14 03:08:23,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2334 states and 3447 transitions. [2023-02-14 03:08:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 03:08:23,195 INFO L428 stractBuchiCegarLoop]: Abstraction has 2334 states and 3447 transitions. [2023-02-14 03:08:23,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2023-02-14 03:08:23,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2334 states and 3447 transitions. [2023-02-14 03:08:23,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2023-02-14 03:08:23,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:08:23,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:08:23,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:23,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:08:23,202 INFO L748 eck$LassoCheckResult]: Stem: 69522#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 69468#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 69469#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 69491#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 69523#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69928#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69926#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69923#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69924#$Ultimate##0 ~n := #in~n; 69927#L25 assume ~n <= 0;#res := 1; 69925#factFINAL assume true; 69922#factEXIT >#68#return; 69917#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69919#$Ultimate##0 ~n := #in~n; 69921#L25 assume ~n <= 0;#res := 1; 69920#factFINAL assume true; 69916#factEXIT >#70#return; 69918#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69919#$Ultimate##0 ~n := #in~n; 69921#L25 assume ~n <= 0;#res := 1; 69920#factFINAL assume true; 69916#factEXIT >#72#return; 69915#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69914#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 69913#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69912#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69911#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69909#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69910#$Ultimate##0 ~n := #in~n; 69938#L25 assume !(~n <= 0); 69934#L26 call #t~ret0 := fact(~n - 1);< 69937#$Ultimate##0 ~n := #in~n; 69941#L25 assume ~n <= 0;#res := 1; 69939#factFINAL assume true; 69940#factEXIT >#66#return; 69931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69932#factFINAL assume true; 69908#factEXIT >#74#return; 69902#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69905#$Ultimate##0 ~n := #in~n; 69907#L25 assume ~n <= 0;#res := 1; 69906#factFINAL assume true; 69901#factEXIT >#76#return; 69899#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69900#$Ultimate##0 ~n := #in~n; 70070#L25 assume !(~n <= 0); 70066#L26 call #t~ret0 := fact(~n - 1);< 70078#$Ultimate##0 ~n := #in~n; 70076#L25 assume ~n <= 0;#res := 1; 70077#factFINAL assume true; 70081#factEXIT >#66#return; 70080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70079#factFINAL assume true; 69898#factEXIT >#78#return; 69896#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69886#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69882#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69875#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69570#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69569#$Ultimate##0 ~n := #in~n; 69571#L25 assume !(~n <= 0); 69564#L26 call #t~ret0 := fact(~n - 1);< 69680#$Ultimate##0 ~n := #in~n; 69674#L25 assume !(~n <= 0); 69563#L26 call #t~ret0 := fact(~n - 1);< 69616#$Ultimate##0 ~n := #in~n; 69671#L25 assume ~n <= 0;#res := 1; 69669#factFINAL assume true; 69670#factEXIT >#66#return; 69581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69582#factFINAL assume true; 69562#factEXIT >#66#return; 69565#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69683#factFINAL assume true; 69640#factEXIT >#74#return; 69545#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69543#$Ultimate##0 ~n := #in~n; 69549#L25 assume ~n <= 0;#res := 1; 69544#factFINAL assume true; 69546#factEXIT >#76#return; 69536#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69626#$Ultimate##0 ~n := #in~n; 69624#L25 assume !(~n <= 0); 69607#L26 call #t~ret0 := fact(~n - 1);< 69622#$Ultimate##0 ~n := #in~n; 69643#L25 assume !(~n <= 0); 69605#L26 call #t~ret0 := fact(~n - 1);< 69630#$Ultimate##0 ~n := #in~n; 69649#L25 assume ~n <= 0;#res := 1; 69642#factFINAL assume true; 69629#factEXIT >#66#return; 69628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69627#factFINAL assume true; 69625#factEXIT >#66#return; 69620#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69693#factFINAL assume true; 69535#factEXIT >#78#return; 69534#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69533#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69532#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69529#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69485#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 69479#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 69481#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70190#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70184#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70186#$Ultimate##0 ~n := #in~n; 70200#L25 assume !(~n <= 0); 70193#L26 call #t~ret0 := fact(~n - 1);< 70196#$Ultimate##0 ~n := #in~n; 70202#L25 assume ~n <= 0;#res := 1; 70198#factFINAL assume true; 70192#factEXIT >#66#return; 70189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70187#factFINAL assume true; 70183#factEXIT >#68#return; 70170#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70179#$Ultimate##0 ~n := #in~n; 70181#L25 assume ~n <= 0;#res := 1; 70180#factFINAL assume true; 70158#factEXIT >#70#return; 70178#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70211#$Ultimate##0 ~n := #in~n; 70231#L25 assume !(~n <= 0); 69589#L26 call #t~ret0 := fact(~n - 1);< 70142#$Ultimate##0 ~n := #in~n; 70232#L25 assume ~n <= 0;#res := 1; 70225#factFINAL assume true; 70223#factEXIT >#66#return; 70221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70220#factFINAL assume true; 70217#factEXIT >#72#return; 70216#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70215#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70214#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70213#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70212#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70199#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70205#$Ultimate##0 ~n := #in~n; 70203#L25 assume !(~n <= 0); 70194#L26 call #t~ret0 := fact(~n - 1);< 70196#$Ultimate##0 ~n := #in~n; 70202#L25 assume ~n <= 0;#res := 1; 70198#factFINAL assume true; 70192#factEXIT >#66#return; 70195#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70598#factFINAL assume true; 70597#factEXIT >#68#return; 70230#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69511#$Ultimate##0 ~n := #in~n; 70236#L25 assume !(~n <= 0); 69590#L26 call #t~ret0 := fact(~n - 1);< 70142#$Ultimate##0 ~n := #in~n; 70232#L25 assume ~n <= 0;#res := 1; 70225#factFINAL assume true; 70223#factEXIT >#66#return; 70224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70704#factFINAL assume true; 70594#factEXIT >#70#return; 70227#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69511#$Ultimate##0 ~n := #in~n; 70236#L25 assume ~n <= 0;#res := 1; 70294#factFINAL assume true; 70293#factEXIT >#72#return; 69487#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69488#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70629#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70627#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70628#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69440#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69441#$Ultimate##0 ~n := #in~n; 69598#L25 assume !(~n <= 0); 69587#L26 call #t~ret0 := fact(~n - 1);< 70142#$Ultimate##0 ~n := #in~n; 70112#L25 assume !(~n <= 0); 69586#L26 call #t~ret0 := fact(~n - 1);< 70094#$Ultimate##0 ~n := #in~n; 70109#L25 assume ~n <= 0;#res := 1; 70110#factFINAL assume true; 70092#factEXIT >#66#return; 70093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70262#factFINAL assume true; 70253#factEXIT >#66#return; 70257#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70698#factFINAL assume true; 70696#factEXIT >#74#return; 69516#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69518#$Ultimate##0 ~n := #in~n; 70694#L25 assume ~n <= 0;#res := 1; 70692#factFINAL assume true; 70691#factEXIT >#76#return; 70652#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70703#$Ultimate##0 ~n := #in~n; 70803#L25 assume !(~n <= 0); 70777#L26 call #t~ret0 := fact(~n - 1);< 70779#$Ultimate##0 ~n := #in~n; 70788#L25 assume !(~n <= 0); 70775#L26 call #t~ret0 := fact(~n - 1);< 70795#$Ultimate##0 ~n := #in~n; 70797#L25 assume ~n <= 0;#res := 1; 70796#factFINAL assume true; 70794#factEXIT >#66#return; 70793#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70789#factFINAL assume true; 70774#factEXIT >#66#return; 70769#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70766#factFINAL assume true; 70762#factEXIT >#78#return; 70751#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69470#binomialCoefficient_returnLabel#2 [2023-02-14 03:08:23,202 INFO L750 eck$LassoCheckResult]: Loop: 69470#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69492#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69521#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70143#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69554#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69599#$Ultimate##0 ~n := #in~n; 69600#L25 assume !(~n <= 0); 69596#L26 call #t~ret0 := fact(~n - 1);< 69597#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70135#L25 assume ~n <= 0;#res := 1; 70133#factFINAL assume true; 70131#factEXIT >#66#return; 70130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70128#factFINAL assume true; 70123#factEXIT >#66#return; 70122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70120#factFINAL assume true; 70113#factEXIT >#66#return; 70111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70095#factFINAL assume true; 70107#factEXIT >#66#return; 70156#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70157#factFINAL assume true; 70155#factEXIT >#66#return; 70154#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70153#factFINAL assume true; 69553#factEXIT >#74#return; 69555#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70239#$Ultimate##0 ~n := #in~n; 70246#L25 assume !(~n <= 0); 70106#L26 call #t~ret0 := fact(~n - 1);< 69597#$Ultimate##0 ~n := #in~n; 70248#L25 assume ~n <= 0;#res := 1; 70245#factFINAL assume true; 70243#factEXIT >#66#return; 70126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70240#factFINAL assume true; 70238#factEXIT >#76#return; 69457#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70237#$Ultimate##0 ~n := #in~n; 70235#L25 assume !(~n <= 0); 70096#L26 call #t~ret0 := fact(~n - 1);< 70121#$Ultimate##0 ~n := #in~n; 70139#L25 assume !(~n <= 0); 70102#L26 call #t~ret0 := fact(~n - 1);< 70127#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70134#L25 assume !(~n <= 0); 70103#L26 call #t~ret0 := fact(~n - 1);< 70132#$Ultimate##0 ~n := #in~n; 70135#L25 assume ~n <= 0;#res := 1; 70133#factFINAL assume true; 70131#factEXIT >#66#return; 70130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70128#factFINAL assume true; 70123#factEXIT >#66#return; 70122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70120#factFINAL assume true; 70113#factEXIT >#66#return; 70111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70095#factFINAL assume true; 70107#factEXIT >#66#return; 69498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69454#factFINAL assume true; 69458#factEXIT >#78#return; 69446#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69470#binomialCoefficient_returnLabel#2 [2023-02-14 03:08:23,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash 794210609, now seen corresponding path program 9 times [2023-02-14 03:08:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:23,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497845645] [2023-02-14 03:08:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:23,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:23,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26618556] [2023-02-14 03:08:23,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:08:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:23,213 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2023-02-14 03:08:23,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 03:08:23,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:08:23,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 03:08:23,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 262 proven. 3 refuted. 0 times theorem prover too weak. 1976 trivial. 0 not checked. [2023-02-14 03:08:23,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:08:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 262 proven. 4 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2023-02-14 03:08:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:08:23,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497845645] [2023-02-14 03:08:23,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:08:23,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26618556] [2023-02-14 03:08:23,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26618556] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:08:23,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:08:23,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2023-02-14 03:08:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575969324] [2023-02-14 03:08:23,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:08:23,537 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:08:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 353822510, now seen corresponding path program 7 times [2023-02-14 03:08:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:08:23,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740668870] [2023-02-14 03:08:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:08:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:08:23,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:08:23,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594441066] [2023-02-14 03:08:23,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 03:08:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:08:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:23,545 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:08:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2023-02-14 03:08:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:08:23,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:08:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:08:23,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:08:29,823 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:29,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:29,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:29,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:29,824 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-14 03:08:29,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:29,824 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:29,824 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:29,824 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-14 03:08:29,824 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:29,824 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:29,825 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:29,827 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:29,828 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:29,830 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:33,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:33,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:40,304 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-02-14 03:08:40,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:40,799 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-14 03:08:40,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:40,803 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:40,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2023-02-14 03:08:40,809 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:40,809 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:40,817 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:40,817 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:40,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:40,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:40,823 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:40,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2023-02-14 03:08:40,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:40,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:40,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:40,848 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:40,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:40,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:40,853 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:40,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2023-02-14 03:08:40,857 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:40,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:40,878 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-14 03:08:40,878 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-14 03:08:40,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2023-02-14 03:08:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:40,884 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:40,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2023-02-14 03:08:40,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-14 03:08:40,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:40,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:40,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:40,902 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:40,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2023-02-14 03:08:40,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-14 03:08:40,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-14 03:08:40,935 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-14 03:08:40,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2023-02-14 03:08:40,939 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:08:40,939 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:08:40,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:08:40,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:08:40,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:08:40,939 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:40,939 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:08:40,939 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:08:40,939 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2023-02-14 03:08:40,939 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:08:40,939 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:08:40,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-14 03:08:40,957 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08: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-14 03:08: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-14 03:08:41,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-14 03:08:41,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-14 03:08:57,555 WARN L233 SmtUtils]: Spent 16.34s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-02-14 03:08:57,967 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:08:57,968 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:08:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:57,977 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:57,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2023-02-14 03:08:57,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-14 03:08:57,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:57,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:57,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:57,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:57,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:57,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:57,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:58,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:58,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2023-02-14 03:08:58,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:58,016 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:58,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2023-02-14 03:08:58,020 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-14 03:08:58,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:58,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:58,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:58,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:58,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:58,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:58,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:58,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:58,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2023-02-14 03:08:58,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:58,043 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:58,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2023-02-14 03:08:58,047 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-14 03:08:58,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:58,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:58,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:58,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:58,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:58,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:58,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:58,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:08:58,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2023-02-14 03:08:58,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:58,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:58,060 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:58,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2023-02-14 03:08:58,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-14 03:08:58,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:08:58,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:08:58,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:08:58,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:08:58,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:08:58,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:08:58,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:08:58,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:08:58,084 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-14 03:08:58,084 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-14 03:08:58,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:08:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:08:58,087 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-14 03:08:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2023-02-14 03:08:58,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:08:58,089 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-14 03:08:58,089 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:08:58,089 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 9 Supporting invariants [] [2023-02-14 03:08:58,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2023-02-14 03:08:58,094 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-14 03:08:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:58,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 03:08:58,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:58,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2023-02-14 03:08:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:59,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 03:08:59,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:08:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-14 03:08:59,485 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-14 03:08:59,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:59,729 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 3225 states and 4629 transitions. Complement of second has 59 states. [2023-02-14 03:08:59,730 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-14 03:08:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:08:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 86 transitions. [2023-02-14 03:08:59,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 86 transitions. Stem has 210 letters. Loop has 80 letters. [2023-02-14 03:08:59,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:08:59,731 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:08:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:08:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:08:59,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 03:08:59,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:00,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 03:09:00,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-14 03:09:01,063 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2023-02-14 03:09:01,074 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:09:01,341 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 3233 states and 4639 transitions. Complement of second has 57 states. [2023-02-14 03:09:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2023-02-14 03:09:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:09:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 85 transitions. [2023-02-14 03:09:01,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 85 transitions. Stem has 210 letters. Loop has 80 letters. [2023-02-14 03:09:01,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:01,342 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:09:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:01,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 03:09:01,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:09:02,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 03:09:02,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-14 03:09:02,378 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 12 loop predicates [2023-02-14 03:09:02,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155 Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:09:02,647 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2334 states and 3447 transitions. cyclomatic complexity: 1155. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 6508 states and 9635 transitions. Complement of second has 79 states. [2023-02-14 03:09:02,648 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-14 03:09:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:09:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 106 transitions. [2023-02-14 03:09:02,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 106 transitions. Stem has 210 letters. Loop has 80 letters. [2023-02-14 03:09:02,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:02,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 106 transitions. Stem has 290 letters. Loop has 80 letters. [2023-02-14 03:09:02,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:02,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 106 transitions. Stem has 210 letters. Loop has 160 letters. [2023-02-14 03:09:02,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:09:02,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6508 states and 9635 transitions. [2023-02-14 03:09:02,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2023-02-14 03:09:02,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6508 states to 4421 states and 6566 transitions. [2023-02-14 03:09:02,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 534 [2023-02-14 03:09:02,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 541 [2023-02-14 03:09:02,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4421 states and 6566 transitions. [2023-02-14 03:09:02,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:02,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4421 states and 6566 transitions. [2023-02-14 03:09:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states and 6566 transitions. [2023-02-14 03:09:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3232. [2023-02-14 03:09:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2046 states have (on average 1.065982404692082) internal successors, (2181), 2104 states have internal predecessors, (2181), 596 states have call successors, (645), 409 states have call predecessors, (645), 590 states have return successors, (2126), 718 states have call predecessors, (2126), 596 states have call successors, (2126) [2023-02-14 03:09:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4952 transitions. [2023-02-14 03:09:02,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3232 states and 4952 transitions. [2023-02-14 03:09:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 03:09:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-14 03:09:02,801 INFO L87 Difference]: Start difference. First operand 3232 states and 4952 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-14 03:09:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:02,961 INFO L93 Difference]: Finished difference Result 3485 states and 5171 transitions. [2023-02-14 03:09:02,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3485 states and 5171 transitions. [2023-02-14 03:09:02,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2023-02-14 03:09:03,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3485 states to 3190 states and 4756 transitions. [2023-02-14 03:09:03,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2023-02-14 03:09:03,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 413 [2023-02-14 03:09:03,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3190 states and 4756 transitions. [2023-02-14 03:09:03,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:03,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3190 states and 4756 transitions. [2023-02-14 03:09:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states and 4756 transitions. [2023-02-14 03:09:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 2932. [2023-02-14 03:09:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 1855 states have (on average 1.0619946091644206) internal successors, (1970), 1910 states have internal predecessors, (1970), 541 states have call successors, (582), 361 states have call predecessors, (582), 536 states have return successors, (1928), 660 states have call predecessors, (1928), 541 states have call successors, (1928) [2023-02-14 03:09:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 4480 transitions. [2023-02-14 03:09:03,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2932 states and 4480 transitions. [2023-02-14 03:09:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 03:09:03,093 INFO L428 stractBuchiCegarLoop]: Abstraction has 2932 states and 4480 transitions. [2023-02-14 03:09:03,093 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2023-02-14 03:09:03,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2932 states and 4480 transitions. [2023-02-14 03:09:03,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2023-02-14 03:09:03,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:03,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:03,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:03,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:03,105 INFO L748 eck$LassoCheckResult]: Stem: 95719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 95657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 95658#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 95681#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 95669#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 95670#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97443#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 97440#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97441#$Ultimate##0 ~n := #in~n; 97444#L25 assume ~n <= 0;#res := 1; 97442#factFINAL assume true; 97439#factEXIT >#68#return; 97434#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97436#$Ultimate##0 ~n := #in~n; 97438#L25 assume ~n <= 0;#res := 1; 97437#factFINAL assume true; 97433#factEXIT >#70#return; 97435#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97436#$Ultimate##0 ~n := #in~n; 97438#L25 assume ~n <= 0;#res := 1; 97437#factFINAL assume true; 97433#factEXIT >#72#return; 97432#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 97430#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 97427#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97423#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97421#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 97416#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 97417#$Ultimate##0 ~n := #in~n; 97429#L25 assume !(~n <= 0); 97425#L26 call #t~ret0 := fact(~n - 1);< 97426#$Ultimate##0 ~n := #in~n; 97431#L25 assume ~n <= 0;#res := 1; 97428#factFINAL assume true; 97424#factEXIT >#66#return; 97422#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97420#factFINAL assume true; 97415#factEXIT >#74#return; 97411#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 97412#$Ultimate##0 ~n := #in~n; 97419#L25 assume ~n <= 0;#res := 1; 97414#factFINAL assume true; 97410#factEXIT >#76#return; 97036#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 97037#$Ultimate##0 ~n := #in~n; 97371#L25 assume !(~n <= 0); 97369#L26 call #t~ret0 := fact(~n - 1);< 97370#$Ultimate##0 ~n := #in~n; 97373#L25 assume ~n <= 0;#res := 1; 97372#factFINAL assume true; 97368#factEXIT >#66#return; 97367#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97366#factFINAL assume true; 97035#factEXIT >#78#return; 97034#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 97033#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 97031#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 97032#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 97352#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 96919#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 96920#$Ultimate##0 ~n := #in~n; 97000#L25 assume !(~n <= 0); 96992#L26 call #t~ret0 := fact(~n - 1);< 97016#$Ultimate##0 ~n := #in~n; 97011#L25 assume !(~n <= 0); 96993#L26 call #t~ret0 := fact(~n - 1);< 97005#$Ultimate##0 ~n := #in~n; 97008#L25 assume ~n <= 0;#res := 1; 97009#factFINAL assume true; 97023#factEXIT >#66#return; 97021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 97020#factFINAL assume true; 96991#factEXIT >#66#return; 96994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96987#factFINAL assume true; 96988#factEXIT >#74#return; 95752#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95753#$Ultimate##0 ~n := #in~n; 95757#L25 assume ~n <= 0;#res := 1; 95754#factFINAL assume true; 95756#factEXIT >#76#return; 95729#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96904#$Ultimate##0 ~n := #in~n; 96901#L25 assume !(~n <= 0); 95764#L26 call #t~ret0 := fact(~n - 1);< 95818#$Ultimate##0 ~n := #in~n; 95817#L25 assume !(~n <= 0); 95765#L26 call #t~ret0 := fact(~n - 1);< 96903#$Ultimate##0 ~n := #in~n; 96907#L25 assume ~n <= 0;#res := 1; 96906#factFINAL assume true; 96902#factEXIT >#66#return; 96899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96898#factFINAL assume true; 95763#factEXIT >#66#return; 95768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96922#factFINAL assume true; 95728#factEXIT >#78#return; 95727#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 95726#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 95725#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95724#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 95678#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 95679#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 95844#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95837#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 95831#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95833#$Ultimate##0 ~n := #in~n; 95849#L25 assume !(~n <= 0); 95840#L26 call #t~ret0 := fact(~n - 1);< 95843#$Ultimate##0 ~n := #in~n; 95852#L25 assume ~n <= 0;#res := 1; 95846#factFINAL assume true; 95839#factEXIT >#66#return; 95836#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95834#factFINAL assume true; 95830#factEXIT >#68#return; 95797#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95790#$Ultimate##0 ~n := #in~n; 95811#L25 assume ~n <= 0;#res := 1; 95791#factFINAL assume true; 95807#factEXIT >#70#return; 95823#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95858#$Ultimate##0 ~n := #in~n; 95929#L25 assume !(~n <= 0); 95862#L26 call #t~ret0 := fact(~n - 1);< 95892#$Ultimate##0 ~n := #in~n; 96004#L25 assume ~n <= 0;#res := 1; 96002#factFINAL assume true; 96000#factEXIT >#66#return; 95999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95994#factFINAL assume true; 95819#factEXIT >#72#return; 95827#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 95864#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95863#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95861#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95860#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 95847#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95853#$Ultimate##0 ~n := #in~n; 95848#L25 assume !(~n <= 0); 95841#L26 call #t~ret0 := fact(~n - 1);< 95843#$Ultimate##0 ~n := #in~n; 95852#L25 assume ~n <= 0;#res := 1; 95846#factFINAL assume true; 95839#factEXIT >#66#return; 95842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95932#factFINAL assume true; 95931#factEXIT >#68#return; 95783#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95704#$Ultimate##0 ~n := #in~n; 95808#L25 assume !(~n <= 0); 95810#L26 call #t~ret0 := fact(~n - 1);< 95892#$Ultimate##0 ~n := #in~n; 96004#L25 assume ~n <= 0;#res := 1; 96002#factFINAL assume true; 96000#factEXIT >#66#return; 96001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98540#factFINAL assume true; 95828#factEXIT >#70#return; 95784#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 95704#$Ultimate##0 ~n := #in~n; 95808#L25 assume ~n <= 0;#res := 1; 95809#factFINAL assume true; 95782#factEXIT >#72#return; 95780#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 95781#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 95776#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95777#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95746#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 95651#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95924#$Ultimate##0 ~n := #in~n; 95908#L25 assume !(~n <= 0); 95881#L26 call #t~ret0 := fact(~n - 1);< 95892#$Ultimate##0 ~n := #in~n; 95898#L25 assume !(~n <= 0); 95880#L26 call #t~ret0 := fact(~n - 1);< 95895#$Ultimate##0 ~n := #in~n; 95899#L25 assume ~n <= 0;#res := 1; 95896#factFINAL assume true; 95894#factEXIT >#66#return; 95893#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95888#factFINAL assume true; 95879#factEXIT >#66#return; 95885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 98553#factFINAL assume true; 98527#factEXIT >#74#return; 95666#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 96014#$Ultimate##0 ~n := #in~n; 96063#L25 assume !(~n <= 0); 95664#L26 call #t~ret0 := fact(~n - 1);< 95667#$Ultimate##0 ~n := #in~n; 96418#L25 assume ~n <= 0;#res := 1; 96781#factFINAL assume true; 96779#factEXIT >#66#return; 96750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96617#factFINAL assume true; 96016#factEXIT >#76#return; 96008#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96012#$Ultimate##0 ~n := #in~n; 96007#L25 assume !(~n <= 0); 96009#L26 call #t~ret0 := fact(~n - 1);< 96034#$Ultimate##0 ~n := #in~n; 96062#L25 assume ~n <= 0;#res := 1; 96061#factFINAL assume true; 96033#factEXIT >#66#return; 96031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96028#factFINAL assume true; 96022#factEXIT >#78#return; 95659#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 95660#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 95683#L42-2 [2023-02-14 03:09:03,105 INFO L750 eck$LassoCheckResult]: Loop: 95683#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 95774#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 95775#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 95632#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 95633#$Ultimate##0 ~n := #in~n; 95966#L25 assume !(~n <= 0); 95946#L26 call #t~ret0 := fact(~n - 1);< 95961#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95997#L25 assume ~n <= 0;#res := 1; 95996#factFINAL assume true; 95992#factEXIT >#66#return; 95991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95987#factFINAL assume true; 95980#factEXIT >#66#return; 95979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95976#factFINAL assume true; 95973#factEXIT >#66#return; 95972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95971#factFINAL assume true; 95970#factEXIT >#66#return; 95969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95968#factFINAL assume true; 95967#factEXIT >#66#return; 95953#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95962#factFINAL assume true; 95936#factEXIT >#66#return; 95935#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95934#factFINAL assume true; 95933#factEXIT >#74#return; 95713#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 95714#$Ultimate##0 ~n := #in~n; 96111#L25 assume !(~n <= 0); 95938#L26 call #t~ret0 := fact(~n - 1);< 95961#$Ultimate##0 ~n := #in~n; 96113#L25 assume ~n <= 0;#res := 1; 96110#factFINAL assume true; 96108#factEXIT >#66#return; 95982#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96099#factFINAL assume true; 96017#factEXIT >#76#return; 95977#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 96010#$Ultimate##0 ~n := #in~n; 96011#L25 assume !(~n <= 0); 95941#L26 call #t~ret0 := fact(~n - 1);< 95978#$Ultimate##0 ~n := #in~n; 95995#L25 assume !(~n <= 0); 95947#L26 call #t~ret0 := fact(~n - 1);< 95986#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95998#L25 assume !(~n <= 0); 95937#L26 call #t~ret0 := fact(~n - 1);< 95993#$Ultimate##0 ~n := #in~n; 95997#L25 assume ~n <= 0;#res := 1; 95996#factFINAL assume true; 95992#factEXIT >#66#return; 95991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95987#factFINAL assume true; 95980#factEXIT >#66#return; 95979#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95976#factFINAL assume true; 95973#factEXIT >#66#return; 95972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 95971#factFINAL assume true; 95970#factEXIT >#66#return; 95957#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 96239#factFINAL assume true; 96100#factEXIT >#78#return; 95737#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 95682#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 95683#L42-2 [2023-02-14 03:09:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2007552804, now seen corresponding path program 10 times [2023-02-14 03:09:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864183462] [2023-02-14 03:09:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:03,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:03,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817814813] [2023-02-14 03:09:03,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:09:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:03,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:03,116 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:03,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2023-02-14 03:09:03,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:09:03,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:09:03,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:03,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1371945364, now seen corresponding path program 8 times [2023-02-14 03:09:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779201076] [2023-02-14 03:09:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:03,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:03,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004371246] [2023-02-14 03:09:03,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:09:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:03,353 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:03,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2023-02-14 03:09:03,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:09:03,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:03,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:09:03,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 80 proven. 242 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-02-14 03:09:03,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 80 proven. 295 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-02-14 03:09:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:05,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779201076] [2023-02-14 03:09:05,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:09:05,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004371246] [2023-02-14 03:09:05,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004371246] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:05,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:09:05,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 29 [2023-02-14 03:09:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254223496] [2023-02-14 03:09:05,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:05,246 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 03:09:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2023-02-14 03:09:05,247 INFO L87 Difference]: Start difference. First operand 2932 states and 4480 transitions. cyclomatic complexity: 1590 Second operand has 29 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2023-02-14 03:09:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:06,230 INFO L93 Difference]: Finished difference Result 5003 states and 7728 transitions. [2023-02-14 03:09:06,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5003 states and 7728 transitions. [2023-02-14 03:09:06,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2023-02-14 03:09:06,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5003 states to 4969 states and 7694 transitions. [2023-02-14 03:09:06,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 654 [2023-02-14 03:09:06,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2023-02-14 03:09:06,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4969 states and 7694 transitions. [2023-02-14 03:09:06,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:06,307 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4969 states and 7694 transitions. [2023-02-14 03:09:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4969 states and 7694 transitions. [2023-02-14 03:09:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4969 to 3098. [2023-02-14 03:09:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 1957 states have (on average 1.0587634133878385) internal successors, (2072), 1998 states have internal predecessors, (2072), 589 states have call successors, (630), 391 states have call predecessors, (630), 552 states have return successors, (2130), 708 states have call predecessors, (2130), 589 states have call successors, (2130) [2023-02-14 03:09:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4832 transitions. [2023-02-14 03:09:06,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3098 states and 4832 transitions. [2023-02-14 03:09:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 03:09:06,493 INFO L428 stractBuchiCegarLoop]: Abstraction has 3098 states and 4832 transitions. [2023-02-14 03:09:06,493 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2023-02-14 03:09:06,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3098 states and 4832 transitions. [2023-02-14 03:09:06,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-14 03:09:06,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:06,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:06,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:06,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:06,503 INFO L748 eck$LassoCheckResult]: Stem: 104227#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 104171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 104172#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 104193#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 104228#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 104728#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 104726#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104723#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104724#$Ultimate##0 ~n := #in~n; 104727#L25 assume ~n <= 0;#res := 1; 104725#factFINAL assume true; 104722#factEXIT >#68#return; 104718#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 104719#$Ultimate##0 ~n := #in~n; 104721#L25 assume ~n <= 0;#res := 1; 104720#factFINAL assume true; 104716#factEXIT >#70#return; 104717#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 104719#$Ultimate##0 ~n := #in~n; 104721#L25 assume ~n <= 0;#res := 1; 104720#factFINAL assume true; 104716#factEXIT >#72#return; 104715#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 104712#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 104708#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 104707#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 104706#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104694#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104695#$Ultimate##0 ~n := #in~n; 104705#L25 assume !(~n <= 0); 104703#L26 call #t~ret0 := fact(~n - 1);< 104704#$Ultimate##0 ~n := #in~n; 104714#L25 assume ~n <= 0;#res := 1; 104711#factFINAL assume true; 104702#factEXIT >#66#return; 104701#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104700#factFINAL assume true; 104693#factEXIT >#74#return; 104689#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 104690#$Ultimate##0 ~n := #in~n; 104699#L25 assume ~n <= 0;#res := 1; 104692#factFINAL assume true; 104688#factEXIT >#76#return; 104685#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 104686#$Ultimate##0 ~n := #in~n; 104710#L25 assume !(~n <= 0); 104697#L26 call #t~ret0 := fact(~n - 1);< 104698#$Ultimate##0 ~n := #in~n; 104713#L25 assume ~n <= 0;#res := 1; 104709#factFINAL assume true; 104696#factEXIT >#66#return; 104691#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104687#factFINAL assume true; 104684#factEXIT >#78#return; 104682#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 104680#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 104679#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 104678#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 104675#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104355#$Ultimate##0 ~n := #in~n; 104423#L25 assume !(~n <= 0); 104328#L26 call #t~ret0 := fact(~n - 1);< 104441#$Ultimate##0 ~n := #in~n; 104435#L25 assume !(~n <= 0); 104325#L26 call #t~ret0 := fact(~n - 1);< 104329#$Ultimate##0 ~n := #in~n; 104432#L25 assume ~n <= 0;#res := 1; 104433#factFINAL assume true; 104324#factEXIT >#66#return; 104326#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104428#factFINAL assume true; 104368#factEXIT >#66#return; 104369#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104359#factFINAL assume true; 104360#factEXIT >#74#return; 104252#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 104250#$Ultimate##0 ~n := #in~n; 104256#L25 assume ~n <= 0;#res := 1; 104251#factFINAL assume true; 104253#factEXIT >#76#return; 104240#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 104346#$Ultimate##0 ~n := #in~n; 104344#L25 assume !(~n <= 0); 104276#L26 call #t~ret0 := fact(~n - 1);< 104341#$Ultimate##0 ~n := #in~n; 104358#L25 assume !(~n <= 0); 104277#L26 call #t~ret0 := fact(~n - 1);< 104350#$Ultimate##0 ~n := #in~n; 104357#L25 assume ~n <= 0;#res := 1; 104356#factFINAL assume true; 104349#factEXIT >#66#return; 104348#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104347#factFINAL assume true; 104345#factEXIT >#66#return; 104338#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 104547#factFINAL assume true; 104239#factEXIT >#78#return; 104238#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 104237#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 104236#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 104235#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 104191#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 104181#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 104182#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105578#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 105572#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 105574#$Ultimate##0 ~n := #in~n; 105585#L25 assume !(~n <= 0); 105580#L26 call #t~ret0 := fact(~n - 1);< 105583#$Ultimate##0 ~n := #in~n; 105586#L25 assume ~n <= 0;#res := 1; 105584#factFINAL assume true; 105579#factEXIT >#66#return; 105577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105575#factFINAL assume true; 105571#factEXIT >#68#return; 105440#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105450#$Ultimate##0 ~n := #in~n; 105473#L25 assume ~n <= 0;#res := 1; 105479#factFINAL assume true; 105474#factEXIT >#70#return; 105445#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105456#$Ultimate##0 ~n := #in~n; 105470#L25 assume !(~n <= 0); 104993#L26 call #t~ret0 := fact(~n - 1);< 104316#$Ultimate##0 ~n := #in~n; 105471#L25 assume ~n <= 0;#res := 1; 105468#factFINAL assume true; 105464#factEXIT >#66#return; 105465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105495#factFINAL assume true; 105421#factEXIT >#72#return; 105449#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 105595#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105594#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105593#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 104196#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104160#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104161#$Ultimate##0 ~n := #in~n; 105587#L25 assume !(~n <= 0); 105581#L26 call #t~ret0 := fact(~n - 1);< 105583#$Ultimate##0 ~n := #in~n; 105586#L25 assume ~n <= 0;#res := 1; 105584#factFINAL assume true; 105579#factEXIT >#66#return; 105582#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106075#factFINAL assume true; 106074#factEXIT >#68#return; 105058#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 104157#$Ultimate##0 ~n := #in~n; 105566#L25 assume !(~n <= 0); 104989#L26 call #t~ret0 := fact(~n - 1);< 104316#$Ultimate##0 ~n := #in~n; 105471#L25 assume ~n <= 0;#res := 1; 105468#factFINAL assume true; 105464#factEXIT >#66#return; 105466#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107226#factFINAL assume true; 105764#factEXIT >#70#return; 104156#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 104157#$Ultimate##0 ~n := #in~n; 105566#L25 assume ~n <= 0;#res := 1; 105758#factFINAL assume true; 105757#factEXIT >#72#return; 105478#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 105754#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 105755#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 105750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105751#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104244#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104318#$Ultimate##0 ~n := #in~n; 104319#L25 assume !(~n <= 0); 104315#L26 call #t~ret0 := fact(~n - 1);< 104316#$Ultimate##0 ~n := #in~n; 105012#L25 assume !(~n <= 0); 104988#L26 call #t~ret0 := fact(~n - 1);< 105004#$Ultimate##0 ~n := #in~n; 105009#L25 assume ~n <= 0;#res := 1; 105005#factFINAL assume true; 105006#factEXIT >#66#return; 105021#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105467#factFINAL assume true; 105460#factEXIT >#66#return; 105463#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107230#factFINAL assume true; 107210#factEXIT >#74#return; 104177#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 104222#$Ultimate##0 ~n := #in~n; 105673#L25 assume !(~n <= 0); 104165#L26 call #t~ret0 := fact(~n - 1);< 104179#$Ultimate##0 ~n := #in~n; 104209#L25 assume ~n <= 0;#res := 1; 104164#factFINAL assume true; 104166#factEXIT >#66#return; 106081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107232#factFINAL assume true; 105687#factEXIT >#76#return; 105666#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105680#$Ultimate##0 ~n := #in~n; 105665#L25 assume !(~n <= 0); 105667#L26 call #t~ret0 := fact(~n - 1);< 105762#$Ultimate##0 ~n := #in~n; 105763#L25 assume ~n <= 0;#res := 1; 105975#factFINAL assume true; 105974#factEXIT >#66#return; 105973#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105972#factFINAL assume true; 105971#factEXIT >#78#return; 105969#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 105967#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 104194#L42-2 [2023-02-14 03:09:06,504 INFO L750 eck$LassoCheckResult]: Loop: 104194#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 104226#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 105051#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 104146#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 104147#$Ultimate##0 ~n := #in~n; 104317#L25 assume !(~n <= 0); 104289#L26 call #t~ret0 := fact(~n - 1);< 105047#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105045#L25 assume ~n <= 0;#res := 1; 105043#factFINAL assume true; 105041#factEXIT >#66#return; 105040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105037#factFINAL assume true; 105030#factEXIT >#66#return; 105029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105026#factFINAL assume true; 105023#factEXIT >#66#return; 105022#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105016#factFINAL assume true; 105013#factEXIT >#66#return; 105010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105011#factFINAL assume true; 105003#factEXIT >#66#return; 104307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105046#factFINAL assume true; 104288#factEXIT >#66#return; 104306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105076#factFINAL assume true; 105071#factEXIT >#74#return; 105064#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 105067#$Ultimate##0 ~n := #in~n; 105078#L25 assume !(~n <= 0); 104296#L26 call #t~ret0 := fact(~n - 1);< 105047#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105045#L25 assume ~n <= 0;#res := 1; 105043#factFINAL assume true; 105041#factEXIT >#66#return; 105040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105037#factFINAL assume true; 105030#factEXIT >#66#return; 105033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105070#factFINAL assume true; 105063#factEXIT >#76#return; 105027#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 105052#$Ultimate##0 ~n := #in~n; 105053#L25 assume !(~n <= 0); 104292#L26 call #t~ret0 := fact(~n - 1);< 105028#$Ultimate##0 ~n := #in~n; 105048#L25 assume !(~n <= 0); 104290#L26 call #t~ret0 := fact(~n - 1);< 105036#$Ultimate##0 ~n := #in~n; 105044#L25 assume !(~n <= 0); 104302#L26 call #t~ret0 := fact(~n - 1);< 105042#$Ultimate##0 ~n := #in~n; 105045#L25 assume ~n <= 0;#res := 1; 105043#factFINAL assume true; 105041#factEXIT >#66#return; 105040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105037#factFINAL assume true; 105030#factEXIT >#66#return; 105029#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 105026#factFINAL assume true; 105023#factEXIT >#66#return; 105014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106073#factFINAL assume true; 106056#factEXIT >#78#return; 104173#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 104174#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 104194#L42-2 [2023-02-14 03:09:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2007552804, now seen corresponding path program 11 times [2023-02-14 03:09:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078277569] [2023-02-14 03:09:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:06,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68133381] [2023-02-14 03:09:06,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:09:06,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,516 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:06,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2023-02-14 03:09:06,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-02-14 03:09:06,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:09:06,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:06,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 680313660, now seen corresponding path program 9 times [2023-02-14 03:09:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:06,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061625306] [2023-02-14 03:09:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:06,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025431237] [2023-02-14 03:09:06,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:09:06,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:06,767 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2023-02-14 03:09:06,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-02-14 03:09:06,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:06,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:09:06,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 85 proven. 234 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-02-14 03:09:06,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 85 proven. 285 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-02-14 03:09:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:08,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061625306] [2023-02-14 03:09:08,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:09:08,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025431237] [2023-02-14 03:09:08,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025431237] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:08,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:09:08,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 27 [2023-02-14 03:09:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200534281] [2023-02-14 03:09:08,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:08,016 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:08,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-14 03:09:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2023-02-14 03:09:08,018 INFO L87 Difference]: Start difference. First operand 3098 states and 4832 transitions. cyclomatic complexity: 1776 Second operand has 27 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2023-02-14 03:09:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:08,663 INFO L93 Difference]: Finished difference Result 4887 states and 7432 transitions. [2023-02-14 03:09:08,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4887 states and 7432 transitions. [2023-02-14 03:09:08,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2023-02-14 03:09:08,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4887 states to 4873 states and 7418 transitions. [2023-02-14 03:09:08,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 649 [2023-02-14 03:09:08,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 649 [2023-02-14 03:09:08,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4873 states and 7418 transitions. [2023-02-14 03:09:08,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:08,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4873 states and 7418 transitions. [2023-02-14 03:09:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states and 7418 transitions. [2023-02-14 03:09:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 3098. [2023-02-14 03:09:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 1957 states have (on average 1.0587634133878385) internal successors, (2072), 1998 states have internal predecessors, (2072), 589 states have call successors, (630), 391 states have call predecessors, (630), 552 states have return successors, (2118), 708 states have call predecessors, (2118), 589 states have call successors, (2118) [2023-02-14 03:09:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4820 transitions. [2023-02-14 03:09:08,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3098 states and 4820 transitions. [2023-02-14 03:09:08,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 03:09:08,856 INFO L428 stractBuchiCegarLoop]: Abstraction has 3098 states and 4820 transitions. [2023-02-14 03:09:08,856 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2023-02-14 03:09:08,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3098 states and 4820 transitions. [2023-02-14 03:09:08,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-14 03:09:08,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:08,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:08,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:08,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:08,865 INFO L748 eck$LassoCheckResult]: Stem: 112785#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 112730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 112731#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 112752#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 112786#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 113457#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113455#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113452#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113453#$Ultimate##0 ~n := #in~n; 113456#L25 assume ~n <= 0;#res := 1; 113454#factFINAL assume true; 113451#factEXIT >#68#return; 113447#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113448#$Ultimate##0 ~n := #in~n; 113450#L25 assume ~n <= 0;#res := 1; 113449#factFINAL assume true; 113445#factEXIT >#70#return; 113446#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113448#$Ultimate##0 ~n := #in~n; 113450#L25 assume ~n <= 0;#res := 1; 113449#factFINAL assume true; 113445#factEXIT >#72#return; 113444#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113442#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 113439#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 113435#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113433#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113430#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113431#$Ultimate##0 ~n := #in~n; 113441#L25 assume !(~n <= 0); 113437#L26 call #t~ret0 := fact(~n - 1);< 113438#$Ultimate##0 ~n := #in~n; 113443#L25 assume ~n <= 0;#res := 1; 113440#factFINAL assume true; 113436#factEXIT >#66#return; 113434#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113432#factFINAL assume true; 113429#factEXIT >#74#return; 113427#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113428#$Ultimate##0 ~n := #in~n; 113459#L25 assume ~n <= 0;#res := 1; 113458#factFINAL assume true; 113426#factEXIT >#76#return; 113423#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113424#$Ultimate##0 ~n := #in~n; 113467#L25 assume !(~n <= 0); 113463#L26 call #t~ret0 := fact(~n - 1);< 113464#$Ultimate##0 ~n := #in~n; 113466#L25 assume ~n <= 0;#res := 1; 113465#factFINAL assume true; 113462#factEXIT >#66#return; 113461#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113460#factFINAL assume true; 113422#factEXIT >#78#return; 113420#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113419#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 113418#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 113417#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113416#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112819#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112908#$Ultimate##0 ~n := #in~n; 112834#L25 assume !(~n <= 0); 112830#L26 call #t~ret0 := fact(~n - 1);< 112979#$Ultimate##0 ~n := #in~n; 112980#L25 assume !(~n <= 0); 112829#L26 call #t~ret0 := fact(~n - 1);< 112883#$Ultimate##0 ~n := #in~n; 112981#L25 assume ~n <= 0;#res := 1; 112982#factFINAL assume true; 112881#factEXIT >#66#return; 112844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112845#factFINAL assume true; 112828#factEXIT >#66#return; 112831#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112818#factFINAL assume true; 112820#factEXIT >#74#return; 112808#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112806#$Ultimate##0 ~n := #in~n; 112812#L25 assume ~n <= 0;#res := 1; 112807#factFINAL assume true; 112809#factEXIT >#76#return; 112895#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112900#$Ultimate##0 ~n := #in~n; 112898#L25 assume !(~n <= 0); 112870#L26 call #t~ret0 := fact(~n - 1);< 112896#$Ultimate##0 ~n := #in~n; 112906#L25 assume !(~n <= 0); 112871#L26 call #t~ret0 := fact(~n - 1);< 112904#$Ultimate##0 ~n := #in~n; 112913#L25 assume ~n <= 0;#res := 1; 112909#factFINAL assume true; 112903#factEXIT >#66#return; 112902#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112901#factFINAL assume true; 112899#factEXIT >#66#return; 112892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113020#factFINAL assume true; 113015#factEXIT >#78#return; 112796#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112795#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 112794#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 112793#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 112750#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 112740#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 112742#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113814#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113810#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113812#$Ultimate##0 ~n := #in~n; 113924#L25 assume !(~n <= 0); 113820#L26 call #t~ret0 := fact(~n - 1);< 113822#$Ultimate##0 ~n := #in~n; 113827#L25 assume ~n <= 0;#res := 1; 113825#factFINAL assume true; 113818#factEXIT >#66#return; 113816#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113813#factFINAL assume true; 113809#factEXIT >#68#return; 113614#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113630#$Ultimate##0 ~n := #in~n; 113703#L25 assume ~n <= 0;#res := 1; 113700#factFINAL assume true; 113694#factEXIT >#70#return; 113620#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113636#$Ultimate##0 ~n := #in~n; 113712#L25 assume !(~n <= 0); 112855#L26 call #t~ret0 := fact(~n - 1);< 113586#$Ultimate##0 ~n := #in~n; 113711#L25 assume ~n <= 0;#res := 1; 113710#factFINAL assume true; 113708#factEXIT >#66#return; 113707#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113631#factFINAL assume true; 113632#factEXIT >#72#return; 113697#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114236#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 114235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114234#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114232#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112719#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112720#$Ultimate##0 ~n := #in~n; 113826#L25 assume !(~n <= 0); 113819#L26 call #t~ret0 := fact(~n - 1);< 113822#$Ultimate##0 ~n := #in~n; 113827#L25 assume ~n <= 0;#res := 1; 113825#factFINAL assume true; 113818#factEXIT >#66#return; 113821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114629#factFINAL assume true; 114630#factEXIT >#68#return; 113589#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112716#$Ultimate##0 ~n := #in~n; 113693#L25 assume !(~n <= 0); 112854#L26 call #t~ret0 := fact(~n - 1);< 113586#$Ultimate##0 ~n := #in~n; 113711#L25 assume ~n <= 0;#res := 1; 113710#factFINAL assume true; 113708#factEXIT >#66#return; 113709#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115769#factFINAL assume true; 114337#factEXIT >#70#return; 113587#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112716#$Ultimate##0 ~n := #in~n; 113693#L25 assume ~n <= 0;#res := 1; 114361#factFINAL assume true; 114308#factEXIT >#72#return; 113695#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114304#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 115788#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115767#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112705#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112706#$Ultimate##0 ~n := #in~n; 112864#L25 assume !(~n <= 0); 112848#L26 call #t~ret0 := fact(~n - 1);< 113586#$Ultimate##0 ~n := #in~n; 113571#L25 assume !(~n <= 0); 112851#L26 call #t~ret0 := fact(~n - 1);< 113563#$Ultimate##0 ~n := #in~n; 113568#L25 assume ~n <= 0;#res := 1; 113564#factFINAL assume true; 113565#factEXIT >#66#return; 113688#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113687#factFINAL assume true; 113682#factEXIT >#66#return; 113683#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115784#factFINAL assume true; 115762#factEXIT >#74#return; 112737#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112780#$Ultimate##0 ~n := #in~n; 114074#L25 assume !(~n <= 0); 112724#L26 call #t~ret0 := fact(~n - 1);< 112738#$Ultimate##0 ~n := #in~n; 112766#L25 assume ~n <= 0;#res := 1; 112767#factFINAL assume true; 114625#factEXIT >#66#return; 114626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115794#factFINAL assume true; 114077#factEXIT >#76#return; 114073#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114076#$Ultimate##0 ~n := #in~n; 114072#L25 assume !(~n <= 0); 112774#L26 call #t~ret0 := fact(~n - 1);< 112773#$Ultimate##0 ~n := #in~n; 112775#L25 assume ~n <= 0;#res := 1; 114500#factFINAL assume true; 114499#factEXIT >#66#return; 114498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114497#factFINAL assume true; 114496#factEXIT >#78#return; 114494#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 114492#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 112753#L42-2 [2023-02-14 03:09:08,865 INFO L750 eck$LassoCheckResult]: Loop: 112753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114487#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113593#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112862#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112865#$Ultimate##0 ~n := #in~n; 112866#L25 assume !(~n <= 0); 112861#L26 call #t~ret0 := fact(~n - 1);< 112863#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113686#L25 assume ~n <= 0;#res := 1; 113680#factFINAL assume true; 113675#factEXIT >#66#return; 113672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113664#factFINAL assume true; 113654#factEXIT >#66#return; 113651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113645#factFINAL assume true; 113580#factEXIT >#66#return; 113579#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113575#factFINAL assume true; 113572#factEXIT >#66#return; 113569#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113570#factFINAL assume true; 113538#factEXIT >#66#return; 113555#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113715#factFINAL assume true; 113678#factEXIT >#66#return; 113677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113673#factFINAL assume true; 113667#factEXIT >#74#return; 113661#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113662#$Ultimate##0 ~n := #in~n; 113719#L25 assume !(~n <= 0); 113542#L26 call #t~ret0 := fact(~n - 1);< 112863#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113681#L25 assume !(~n <= 0); 113551#L26 call #t~ret0 := fact(~n - 1);< 113676#$Ultimate##0 ~n := #in~n; 113686#L25 assume ~n <= 0;#res := 1; 113680#factFINAL assume true; 113675#factEXIT >#66#return; 113672#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113664#factFINAL assume true; 113654#factEXIT >#66#return; 113651#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113645#factFINAL assume true; 113580#factEXIT >#66#return; 113557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114273#factFINAL assume true; 114129#factEXIT >#76#return; 112787#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112788#$Ultimate##0 ~n := #in~n; 114274#L25 assume !(~n <= 0); 113543#L26 call #t~ret0 := fact(~n - 1);< 112863#$Ultimate##0 ~n := #in~n; 113725#L25 assume ~n <= 0;#res := 1; 113723#factFINAL assume true; 113721#factEXIT >#66#return; 113582#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114513#factFINAL assume true; 114512#factEXIT >#78#return; 112732#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112733#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 112753#L42-2 [2023-02-14 03:09:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2007552804, now seen corresponding path program 12 times [2023-02-14 03:09:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:08,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814283879] [2023-02-14 03:09:08,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:08,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:08,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017658313] [2023-02-14 03:09:08,875 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:09:08,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:08,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:08,878 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2023-02-14 03:09:09,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-14 03:09:09,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:09:09,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:09,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1342567028, now seen corresponding path program 10 times [2023-02-14 03:09:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313882936] [2023-02-14 03:09:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:09,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:09,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549324097] [2023-02-14 03:09:09,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 03:09:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:09,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:09,149 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:09,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2023-02-14 03:09:09,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 03:09:09,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:09,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 03:09:09,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 87 proven. 186 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-02-14 03:09:09,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 86 proven. 227 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-14 03:09:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:10,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313882936] [2023-02-14 03:09:10,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:09:10,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549324097] [2023-02-14 03:09:10,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549324097] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:10,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:09:10,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 28 [2023-02-14 03:09:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334217169] [2023-02-14 03:09:10,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:10,279 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 03:09:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2023-02-14 03:09:10,280 INFO L87 Difference]: Start difference. First operand 3098 states and 4820 transitions. cyclomatic complexity: 1764 Second operand has 28 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (23), 14 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-14 03:09:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:11,497 INFO L93 Difference]: Finished difference Result 5339 states and 8356 transitions. [2023-02-14 03:09:11,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5339 states and 8356 transitions. [2023-02-14 03:09:11,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2023-02-14 03:09:11,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5339 states to 5209 states and 8196 transitions. [2023-02-14 03:09:11,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 713 [2023-02-14 03:09:11,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 713 [2023-02-14 03:09:11,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5209 states and 8196 transitions. [2023-02-14 03:09:11,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:11,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5209 states and 8196 transitions. [2023-02-14 03:09:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5209 states and 8196 transitions. [2023-02-14 03:09:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5209 to 3296. [2023-02-14 03:09:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 2077 states have (on average 1.0553683196918633) internal successors, (2192), 2118 states have internal predecessors, (2192), 619 states have call successors, (662), 403 states have call predecessors, (662), 600 states have return successors, (2283), 774 states have call predecessors, (2283), 619 states have call successors, (2283) [2023-02-14 03:09:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 5137 transitions. [2023-02-14 03:09:11,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3296 states and 5137 transitions. [2023-02-14 03:09:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 03:09:11,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 3296 states and 5137 transitions. [2023-02-14 03:09:11,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2023-02-14 03:09:11,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3296 states and 5137 transitions. [2023-02-14 03:09:11,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2023-02-14 03:09:11,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:11,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:11,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:11,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:11,718 INFO L748 eck$LassoCheckResult]: Stem: 121764#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 121704#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 121705#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 121728#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 121765#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 122148#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122146#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 122142#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122143#$Ultimate##0 ~n := #in~n; 122147#L25 assume ~n <= 0;#res := 1; 122145#factFINAL assume true; 122141#factEXIT >#68#return; 122139#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122140#$Ultimate##0 ~n := #in~n; 122152#L25 assume ~n <= 0;#res := 1; 122149#factFINAL assume true; 122137#factEXIT >#70#return; 122138#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122140#$Ultimate##0 ~n := #in~n; 122152#L25 assume ~n <= 0;#res := 1; 122149#factFINAL assume true; 122137#factEXIT >#72#return; 122135#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 122134#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122129#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122125#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 122114#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122115#$Ultimate##0 ~n := #in~n; 122131#L25 assume !(~n <= 0); 122123#L26 call #t~ret0 := fact(~n - 1);< 122124#$Ultimate##0 ~n := #in~n; 122132#L25 assume ~n <= 0;#res := 1; 122128#factFINAL assume true; 122122#factEXIT >#66#return; 122121#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122120#factFINAL assume true; 122113#factEXIT >#74#return; 122109#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122110#$Ultimate##0 ~n := #in~n; 122119#L25 assume ~n <= 0;#res := 1; 122112#factFINAL assume true; 122108#factEXIT >#76#return; 122105#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122106#$Ultimate##0 ~n := #in~n; 122127#L25 assume !(~n <= 0); 122117#L26 call #t~ret0 := fact(~n - 1);< 122118#$Ultimate##0 ~n := #in~n; 122130#L25 assume ~n <= 0;#res := 1; 122126#factFINAL assume true; 122116#factEXIT >#66#return; 122111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122107#factFINAL assume true; 122104#factEXIT >#78#return; 122101#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 122099#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 122097#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122096#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122095#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 121802#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121884#$Ultimate##0 ~n := #in~n; 121810#L25 assume !(~n <= 0); 121811#L26 call #t~ret0 := fact(~n - 1);< 121956#$Ultimate##0 ~n := #in~n; 121957#L25 assume !(~n <= 0); 121816#L26 call #t~ret0 := fact(~n - 1);< 121859#$Ultimate##0 ~n := #in~n; 121960#L25 assume ~n <= 0;#res := 1; 121958#factFINAL assume true; 121959#factEXIT >#66#return; 121969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121815#factFINAL assume true; 121817#factEXIT >#66#return; 121801#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121803#factFINAL assume true; 121883#factEXIT >#74#return; 121787#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121785#$Ultimate##0 ~n := #in~n; 121791#L25 assume ~n <= 0;#res := 1; 121786#factFINAL assume true; 121788#factEXIT >#76#return; 121777#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121879#$Ultimate##0 ~n := #in~n; 121873#L25 assume !(~n <= 0); 121846#L26 call #t~ret0 := fact(~n - 1);< 121871#$Ultimate##0 ~n := #in~n; 121892#L25 assume !(~n <= 0); 121847#L26 call #t~ret0 := fact(~n - 1);< 121891#$Ultimate##0 ~n := #in~n; 121922#L25 assume ~n <= 0;#res := 1; 121920#factFINAL assume true; 121890#factEXIT >#66#return; 121889#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121888#factFINAL assume true; 121878#factEXIT >#66#return; 121868#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122072#factFINAL assume true; 121776#factEXIT >#78#return; 121775#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 121774#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121773#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121772#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 121726#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 121716#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 121718#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122816#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 122799#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122801#$Ultimate##0 ~n := #in~n; 122826#L25 assume !(~n <= 0); 122819#L26 call #t~ret0 := fact(~n - 1);< 122821#$Ultimate##0 ~n := #in~n; 122827#L25 assume ~n <= 0;#res := 1; 122824#factFINAL assume true; 122817#factEXIT >#66#return; 122814#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122806#factFINAL assume true; 122798#factEXIT >#68#return; 122747#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122755#$Ultimate##0 ~n := #in~n; 122763#L25 assume ~n <= 0;#res := 1; 122764#factFINAL assume true; 122728#factEXIT >#70#return; 122754#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122761#$Ultimate##0 ~n := #in~n; 122777#L25 assume !(~n <= 0); 121825#L26 call #t~ret0 := fact(~n - 1);< 121838#$Ultimate##0 ~n := #in~n; 122779#L25 assume ~n <= 0;#res := 1; 122768#factFINAL assume true; 122766#factEXIT >#66#return; 122765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122757#factFINAL assume true; 122760#factEXIT >#72#return; 121722#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 121723#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 121735#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 123518#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 121732#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 121689#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121698#$Ultimate##0 ~n := #in~n; 122828#L25 assume !(~n <= 0); 122818#L26 call #t~ret0 := fact(~n - 1);< 122821#$Ultimate##0 ~n := #in~n; 122827#L25 assume ~n <= 0;#res := 1; 122824#factFINAL assume true; 122817#factEXIT >#66#return; 122820#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121700#factFINAL assume true; 121688#factEXIT >#68#return; 121690#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121750#$Ultimate##0 ~n := #in~n; 122782#L25 assume !(~n <= 0); 121824#L26 call #t~ret0 := fact(~n - 1);< 121838#$Ultimate##0 ~n := #in~n; 122779#L25 assume ~n <= 0;#res := 1; 122768#factFINAL assume true; 122766#factEXIT >#66#return; 122767#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124923#factFINAL assume true; 123515#factEXIT >#70#return; 122770#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 121750#$Ultimate##0 ~n := #in~n; 122782#L25 assume ~n <= 0;#res := 1; 123514#factFINAL assume true; 123513#factEXIT >#72#return; 122749#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 124978#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 124977#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 124976#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 124921#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 121684#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121685#$Ultimate##0 ~n := #in~n; 121842#L25 assume !(~n <= 0); 121828#L26 call #t~ret0 := fact(~n - 1);< 121838#$Ultimate##0 ~n := #in~n; 122536#L25 assume !(~n <= 0); 121830#L26 call #t~ret0 := fact(~n - 1);< 122511#$Ultimate##0 ~n := #in~n; 122533#L25 assume ~n <= 0;#res := 1; 122534#factFINAL assume true; 122509#factEXIT >#66#return; 122510#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122811#factFINAL assume true; 122807#factEXIT >#66#return; 122810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124968#factFINAL assume true; 124911#factEXIT >#74#return; 122849#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121757#$Ultimate##0 ~n := #in~n; 122847#L25 assume !(~n <= 0); 122850#L26 call #t~ret0 := fact(~n - 1);< 123501#$Ultimate##0 ~n := #in~n; 123523#L25 assume ~n <= 0;#res := 1; 123533#factFINAL assume true; 123499#factEXIT >#66#return; 123500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 124972#factFINAL assume true; 123149#factEXIT >#76#return; 121711#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122854#$Ultimate##0 ~n := #in~n; 122855#L25 assume !(~n <= 0); 121710#L26 call #t~ret0 := fact(~n - 1);< 121712#$Ultimate##0 ~n := #in~n; 121744#L25 assume ~n <= 0;#res := 1; 121745#factFINAL assume true; 123638#factEXIT >#66#return; 123637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123636#factFINAL assume true; 123635#factEXIT >#78#return; 123633#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 123634#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121729#L42-2 [2023-02-14 03:09:11,718 INFO L750 eck$LassoCheckResult]: Loop: 121729#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 121761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122598#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 121840#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122592#$Ultimate##0 ~n := #in~n; 121839#L25 assume !(~n <= 0); 121841#L26 call #t~ret0 := fact(~n - 1);< 122602#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122575#L25 assume ~n <= 0;#res := 1; 122574#factFINAL assume true; 122572#factEXIT >#66#return; 122571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122569#factFINAL assume true; 122563#factEXIT >#66#return; 122559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122556#factFINAL assume true; 122550#factEXIT >#66#return; 122549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122546#factFINAL assume true; 122537#factEXIT >#66#return; 122535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122512#factFINAL assume true; 122530#factEXIT >#66#return; 122600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122694#factFINAL assume true; 122599#factEXIT >#66#return; 122597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122596#factFINAL assume true; 122591#factEXIT >#74#return; 122584#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122587#$Ultimate##0 ~n := #in~n; 122657#L25 assume ~n <= 0;#res := 1; 122658#factFINAL assume true; 122823#factEXIT >#76#return; 122531#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122805#$Ultimate##0 ~n := #in~n; 122797#L25 assume !(~n <= 0); 122523#L26 call #t~ret0 := fact(~n - 1);< 122532#$Ultimate##0 ~n := #in~n; 122562#L25 assume !(~n <= 0); 122526#L26 call #t~ret0 := fact(~n - 1);< 122545#$Ultimate##0 ~n := #in~n; 122653#L25 assume !(~n <= 0); 122525#L26 call #t~ret0 := fact(~n - 1);< 122555#$Ultimate##0 ~n := #in~n; 122579#L25 assume !(~n <= 0); 122524#L26 call #t~ret0 := fact(~n - 1);< 122568#$Ultimate##0 ~n := #in~n; 122576#L25 assume !(~n <= 0); 122513#L26 call #t~ret0 := fact(~n - 1);< 122573#$Ultimate##0 ~n := #in~n; 122575#L25 assume ~n <= 0;#res := 1; 122574#factFINAL assume true; 122572#factEXIT >#66#return; 122571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122569#factFINAL assume true; 122563#factEXIT >#66#return; 122559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122556#factFINAL assume true; 122550#factEXIT >#66#return; 122549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122546#factFINAL assume true; 122537#factEXIT >#66#return; 122535#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122512#factFINAL assume true; 122530#factEXIT >#66#return; 122601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123654#factFINAL assume true; 123639#factEXIT >#78#return; 121706#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 121707#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121729#L42-2 [2023-02-14 03:09:11,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2007552804, now seen corresponding path program 13 times [2023-02-14 03:09:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476398146] [2023-02-14 03:09:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452596424] [2023-02-14 03:09:11,728 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 03:09:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:11,732 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:11,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2023-02-14 03:09:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:11,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:11,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash -972875972, now seen corresponding path program 11 times [2023-02-14 03:09:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780578263] [2023-02-14 03:09:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:11,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538780604] [2023-02-14 03:09:11,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 03:09:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:12,009 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:12,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2023-02-14 03:09:12,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2023-02-14 03:09:12,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:12,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 03:09:12,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 78 proven. 247 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-02-14 03:09:12,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 78 proven. 302 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-02-14 03:09:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:13,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780578263] [2023-02-14 03:09:13,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:09:13,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538780604] [2023-02-14 03:09:13,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538780604] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:13,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:09:13,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 31 [2023-02-14 03:09:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623854928] [2023-02-14 03:09:13,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:09:13,975 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:09:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:09:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 03:09:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2023-02-14 03:09:13,976 INFO L87 Difference]: Start difference. First operand 3296 states and 5137 transitions. cyclomatic complexity: 1883 Second operand has 31 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 17 states have call successors, (17), 1 states have call predecessors, (17), 13 states have return successors, (26), 15 states have call predecessors, (26), 17 states have call successors, (26) [2023-02-14 03:09:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:09:14,942 INFO L93 Difference]: Finished difference Result 5051 states and 7832 transitions. [2023-02-14 03:09:14,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5051 states and 7832 transitions. [2023-02-14 03:09:14,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2023-02-14 03:09:15,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5051 states to 5031 states and 7812 transitions. [2023-02-14 03:09:15,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2023-02-14 03:09:15,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2023-02-14 03:09:15,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5031 states and 7812 transitions. [2023-02-14 03:09:15,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:09:15,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5031 states and 7812 transitions. [2023-02-14 03:09:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states and 7812 transitions. [2023-02-14 03:09:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 3474. [2023-02-14 03:09:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 2183 states have (on average 1.0526797984425103) internal successors, (2298), 2234 states have internal predecessors, (2298), 667 states have call successors, (710), 439 states have call predecessors, (710), 624 states have return successors, (2403), 800 states have call predecessors, (2403), 667 states have call successors, (2403) [2023-02-14 03:09:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 5411 transitions. [2023-02-14 03:09:15,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3474 states and 5411 transitions. [2023-02-14 03:09:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 03:09:15,091 INFO L428 stractBuchiCegarLoop]: Abstraction has 3474 states and 5411 transitions. [2023-02-14 03:09:15,091 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2023-02-14 03:09:15,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3474 states and 5411 transitions. [2023-02-14 03:09:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2023-02-14 03:09:15,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:09:15,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:09:15,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:15,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:09:15,101 INFO L748 eck$LassoCheckResult]: Stem: 130695#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 130638#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 130639#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 130662#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 130696#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 131134#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131132#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 131129#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 131130#$Ultimate##0 ~n := #in~n; 131133#L25 assume ~n <= 0;#res := 1; 131131#factFINAL assume true; 131128#factEXIT >#68#return; 131124#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131125#$Ultimate##0 ~n := #in~n; 131127#L25 assume ~n <= 0;#res := 1; 131126#factFINAL assume true; 131122#factEXIT >#70#return; 131123#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131125#$Ultimate##0 ~n := #in~n; 131127#L25 assume ~n <= 0;#res := 1; 131126#factFINAL assume true; 131122#factEXIT >#72#return; 131121#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 131119#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 131116#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131112#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131110#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 131107#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 131108#$Ultimate##0 ~n := #in~n; 131118#L25 assume !(~n <= 0); 131114#L26 call #t~ret0 := fact(~n - 1);< 131115#$Ultimate##0 ~n := #in~n; 131120#L25 assume ~n <= 0;#res := 1; 131117#factFINAL assume true; 131113#factEXIT >#66#return; 131111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131109#factFINAL assume true; 131106#factEXIT >#74#return; 131102#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131103#$Ultimate##0 ~n := #in~n; 131154#L25 assume ~n <= 0;#res := 1; 131153#factFINAL assume true; 131101#factEXIT >#76#return; 131098#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131099#$Ultimate##0 ~n := #in~n; 131151#L25 assume !(~n <= 0); 131148#L26 call #t~ret0 := fact(~n - 1);< 131149#$Ultimate##0 ~n := #in~n; 131152#L25 assume ~n <= 0;#res := 1; 131150#factFINAL assume true; 131147#factEXIT >#66#return; 131144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131143#factFINAL assume true; 131097#factEXIT >#78#return; 131096#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 131095#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 131091#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131090#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130899#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 130730#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130821#$Ultimate##0 ~n := #in~n; 130746#L25 assume !(~n <= 0); 130742#L26 call #t~ret0 := fact(~n - 1);< 130892#$Ultimate##0 ~n := #in~n; 130893#L25 assume !(~n <= 0); 130741#L26 call #t~ret0 := fact(~n - 1);< 130796#$Ultimate##0 ~n := #in~n; 130889#L25 assume ~n <= 0;#res := 1; 130890#factFINAL assume true; 130794#factEXIT >#66#return; 130756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130757#factFINAL assume true; 130740#factEXIT >#66#return; 130743#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130729#factFINAL assume true; 130731#factEXIT >#74#return; 130718#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130716#$Ultimate##0 ~n := #in~n; 130722#L25 assume ~n <= 0;#res := 1; 130717#factFINAL assume true; 130719#factEXIT >#76#return; 130708#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130813#$Ultimate##0 ~n := #in~n; 130810#L25 assume !(~n <= 0); 130781#L26 call #t~ret0 := fact(~n - 1);< 130808#$Ultimate##0 ~n := #in~n; 130819#L25 assume !(~n <= 0); 130782#L26 call #t~ret0 := fact(~n - 1);< 130817#$Ultimate##0 ~n := #in~n; 130826#L25 assume ~n <= 0;#res := 1; 130822#factFINAL assume true; 130816#factEXIT >#66#return; 130815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130814#factFINAL assume true; 130811#factEXIT >#66#return; 130805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131007#factFINAL assume true; 130707#factEXIT >#78#return; 130706#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 130705#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130704#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130703#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 130660#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 130650#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 130652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 132007#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 132003#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 132005#$Ultimate##0 ~n := #in~n; 132015#L25 assume !(~n <= 0); 132012#L26 call #t~ret0 := fact(~n - 1);< 132013#$Ultimate##0 ~n := #in~n; 132016#L25 assume ~n <= 0;#res := 1; 132014#factFINAL assume true; 132010#factEXIT >#66#return; 132008#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132006#factFINAL assume true; 132002#factEXIT >#68#return; 131586#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131600#$Ultimate##0 ~n := #in~n; 131792#L25 assume ~n <= 0;#res := 1; 131748#factFINAL assume true; 131738#factEXIT >#70#return; 131588#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131709#$Ultimate##0 ~n := #in~n; 131721#L25 assume !(~n <= 0); 130763#L26 call #t~ret0 := fact(~n - 1);< 130773#$Ultimate##0 ~n := #in~n; 131722#L25 assume ~n <= 0;#res := 1; 131713#factFINAL assume true; 131711#factEXIT >#66#return; 131710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131708#factFINAL assume true; 131705#factEXIT >#72#return; 130656#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 130657#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130668#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130694#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130665#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 130620#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130629#$Ultimate##0 ~n := #in~n; 132017#L25 assume !(~n <= 0); 132011#L26 call #t~ret0 := fact(~n - 1);< 132013#$Ultimate##0 ~n := #in~n; 132016#L25 assume ~n <= 0;#res := 1; 132014#factFINAL assume true; 132010#factEXIT >#66#return; 130670#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130671#factFINAL assume true; 130619#factEXIT >#68#return; 130621#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130626#$Ultimate##0 ~n := #in~n; 131963#L25 assume !(~n <= 0); 130762#L26 call #t~ret0 := fact(~n - 1);< 130773#$Ultimate##0 ~n := #in~n; 131722#L25 assume ~n <= 0;#res := 1; 131713#factFINAL assume true; 131711#factEXIT >#66#return; 131712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134033#factFINAL assume true; 132685#factEXIT >#70#return; 131719#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130626#$Ultimate##0 ~n := #in~n; 131963#L25 assume ~n <= 0;#res := 1; 132421#factFINAL assume true; 132420#factEXIT >#72#return; 131739#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 134084#binomialCoefficient_returnLabel#1 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 134083#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 134082#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 134032#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 130615#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130616#$Ultimate##0 ~n := #in~n; 130777#L25 assume !(~n <= 0); 130760#L26 call #t~ret0 := fact(~n - 1);< 130773#$Ultimate##0 ~n := #in~n; 131496#L25 assume !(~n <= 0); 130768#L26 call #t~ret0 := fact(~n - 1);< 131495#$Ultimate##0 ~n := #in~n; 131492#L25 assume ~n <= 0;#res := 1; 131493#factFINAL assume true; 131466#factEXIT >#66#return; 131467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131760#factFINAL assume true; 131756#factEXIT >#66#return; 131758#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134047#factFINAL assume true; 134018#factEXIT >#74#return; 130645#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130691#$Ultimate##0 ~n := #in~n; 132506#L25 assume !(~n <= 0); 130644#L26 call #t~ret0 := fact(~n - 1);< 130648#$Ultimate##0 ~n := #in~n; 132549#L25 assume ~n <= 0;#res := 1; 132727#factFINAL assume true; 132716#factEXIT >#66#return; 132717#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 134086#factFINAL assume true; 132509#factEXIT >#76#return; 132505#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 132507#$Ultimate##0 ~n := #in~n; 132504#L25 assume !(~n <= 0); 130683#L26 call #t~ret0 := fact(~n - 1);< 130682#$Ultimate##0 ~n := #in~n; 130684#L25 assume ~n <= 0;#res := 1; 132606#factFINAL assume true; 132605#factEXIT >#66#return; 132604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132603#factFINAL assume true; 132602#factEXIT >#78#return; 132600#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 132599#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130663#L42-2 [2023-02-14 03:09:15,101 INFO L750 eck$LassoCheckResult]: Loop: 130663#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 132521#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131552#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 130775#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 131542#$Ultimate##0 ~n := #in~n; 130774#L25 assume !(~n <= 0); 130776#L26 call #t~ret0 := fact(~n - 1);< 131551#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131555#L25 assume ~n <= 0;#res := 1; 131553#factFINAL assume true; 131543#factEXIT >#66#return; 131539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131533#factFINAL assume true; 131526#factEXIT >#66#return; 131524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131520#factFINAL assume true; 131513#factEXIT >#66#return; 131511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131506#factFINAL assume true; 131497#factEXIT >#66#return; 131494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131471#factFINAL assume true; 131489#factEXIT >#66#return; 131549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131556#factFINAL assume true; 131548#factEXIT >#66#return; 131547#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131546#factFINAL assume true; 131541#factEXIT >#74#return; 131537#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131538#$Ultimate##0 ~n := #in~n; 131545#L25 assume !(~n <= 0); 131486#L26 call #t~ret0 := fact(~n - 1);< 131551#$Ultimate##0 ~n := #in~n; 131794#L25 assume ~n <= 0;#res := 1; 131742#factFINAL assume true; 131733#factEXIT >#66#return; 131734#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131925#factFINAL assume true; 131914#factEXIT >#76#return; 131490#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131898#$Ultimate##0 ~n := #in~n; 131895#L25 assume !(~n <= 0); 131473#L26 call #t~ret0 := fact(~n - 1);< 131491#$Ultimate##0 ~n := #in~n; 131563#L25 assume !(~n <= 0); 131478#L26 call #t~ret0 := fact(~n - 1);< 131505#$Ultimate##0 ~n := #in~n; 131509#L25 assume !(~n <= 0); 131479#L26 call #t~ret0 := fact(~n - 1);< 131518#$Ultimate##0 ~n := #in~n; 131562#L25 assume !(~n <= 0); 131482#L26 call #t~ret0 := fact(~n - 1);< 131532#$Ultimate##0 ~n := #in~n; 131554#L25 assume !(~n <= 0); 131472#L26 call #t~ret0 := fact(~n - 1);< 131544#$Ultimate##0 ~n := #in~n; 131555#L25 assume ~n <= 0;#res := 1; 131553#factFINAL assume true; 131543#factEXIT >#66#return; 131539#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131533#factFINAL assume true; 131526#factEXIT >#66#return; 131524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131520#factFINAL assume true; 131513#factEXIT >#66#return; 131511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131506#factFINAL assume true; 131497#factEXIT >#66#return; 131494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131471#factFINAL assume true; 131489#factEXIT >#66#return; 131559#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 132641#factFINAL assume true; 132635#factEXIT >#78#return; 130640#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 130641#binomialCoefficient_returnLabel#2 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130663#L42-2 [2023-02-14 03:09:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2007552804, now seen corresponding path program 14 times [2023-02-14 03:09:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:15,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824415201] [2023-02-14 03:09:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:15,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844574399] [2023-02-14 03:09:15,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 03:09:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:15,131 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:15,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2023-02-14 03:09:15,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 03:09:15,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:09:15,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:15,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1248287540, now seen corresponding path program 12 times [2023-02-14 03:09:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:15,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759384075] [2023-02-14 03:09:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:15,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:15,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729623355] [2023-02-14 03:09:15,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 03:09:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:15,435 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:15,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2023-02-14 03:09:15,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2023-02-14 03:09:15,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 03:09:15,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:09:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:09:15,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:09:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:09:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1715776553, now seen corresponding path program 15 times [2023-02-14 03:09:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:09:15,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214637177] [2023-02-14 03:09:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:09:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:09:15,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 03:09:15,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701849019] [2023-02-14 03:09:15,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 03:09:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 03:09:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:09:15,712 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 03:09:15,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2023-02-14 03:09:15,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-02-14 03:09:15,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 03:09:15,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 03:09:15,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:09:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5084 backedges. 2454 proven. 209 refuted. 0 times theorem prover too weak. 2421 trivial. 0 not checked. [2023-02-14 03:09:16,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 03:09:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5084 backedges. 198 proven. 396 refuted. 0 times theorem prover too weak. 4490 trivial. 0 not checked. [2023-02-14 03:09:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:09:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214637177] [2023-02-14 03:09:16,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 03:09:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701849019] [2023-02-14 03:09:16,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701849019] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 03:09:16,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 03:09:16,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 17 [2023-02-14 03:09:16,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484124301] [2023-02-14 03:09:16,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 03:11:12,937 WARN L233 SmtUtils]: Spent 1.93m on a formula simplification. DAG size of input: 97 DAG size of output: 91 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-14 03:11:19,333 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 03:11:24,551 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 03:11:41,328 WARN L233 SmtUtils]: Spent 16.63s on a formula simplification. DAG size of input: 19 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 03:11:49,649 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 03:11:57,143 WARN L233 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-14 03:12:06,614 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)